| 2003 | Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors. | Graud Krawezik |
| 2003 | Information gathering in adversarial systems: lines and cycles. | Kishore Kothapalli, Christian Scheideler |
| 2003 | Scheduling policies for CIOQ switches. | Alexander Kesselman, Adi Rosn |
| 2003 | Buffer overflows of merging streams. | Alexander Kesselman, Yishay Mansour, Zvi Lotker, Boaz Patt-Shamir |
| 2003 | On local algorithms for topology control and routing in ad hoc networks. | Lujun Jia, Rajmohan Rajaraman, Christian Scheideler |
| 2003 | A polynomial-time tree decomposition to minimize congestion. | Chris Harrelson, Kirsten Hildrum, Satish Rao |
| 2003 | Cycle stealing under immediate dispatch task assignment. | Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante |
| 2003 | Randomized permutations in a coarse grained parallel environment. | Jens Gustedt |
| 2003 | Tree based MPLS routing. | Anupam Gupta, Amit Kumar, Mikkel Thorup |
| 2003 | Load balancing of unit size tokens and expansion properties of graphs. | Robert Elssser, Burkhard Monien |
| 2003 | TCP is competitive against a limited adversary. | Jeff Edmonds, Suprakash Datta, Patrick W. Dymond |
| 2003 | Asynchronous parallel disk sorting. | Roman Dementiev, Peter Sanders |
| 2003 | The effect of communication costs in solid-state quantum computing architectures. | Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Frederic T. Chong, Isaac L. Chuang, John Kubiatowicz |
| 2003 | Relaxing the problem-size bound for out-of-core columnsort. | Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen |
| 2003 | The complexity of verifying memory coherence. | Jason F. Cantin, Mikko H. Lipasti, James E. Smith |
| 2003 | High throughput, parallelized 128-bit AES encryption in a resource-limited FPGA. | Christopher Caltagirone, Kasi Anantha |
| 2003 | Analysis of link reversal routing algorithms for mobile ad hoc networks. | Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura |
| 2003 | Toward a decidable notion of sequential consistency. | Jesse D. Bingham, Anne Condon, Alan J. Hu |
| 2003 | A practical algorithm for constructing oblivious routing schemes. | Marcin Bienkowski, Miroslaw Korzeniowski, Harald Rcke |
| 2003 | Efficient galois field arithmetic on SIMD architectures. | Raghav Bhaskar, Pradeep K. Dubey, Vijay Kumar, Atri Rudra |
| 2003 | Can we elect if we cannot compare? | Lali Barrire, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
| 2003 | Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. | Amotz Bar-Noy, Justin Goshi, Richard E. Ladner |
| 2003 | Online oblivious routing. | Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson |
| 2003 | Bicriteria approximation algorithms for scheduling problems with communications. | Evripidis Bampis, Alexander V. Kononov |
| 2003 | Short length menger's theorem and reliable optical routing. | Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman |