| 2003 | A near optimal scheduler for switch-memory-switch routers. Adnan Aziz, Amit Prakash, Vijaya Ramachandran |
| 2003 | A polynomial-time tree decomposition to minimize congestion. Chris Harrelson, Kirsten Hildrum, Satish Rao |
| 2003 | A practical algorithm for constructing oblivious routing schemes. Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke |
| 2003 | A proportionate fair scheduling rule with good worst-case performance. Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson |
| 2003 | Analysis of link reversal routing algorithms for mobile ad hoc networks. Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura |
| 2003 | Asynchronous parallel disk sorting. Roman Dementiev, Peter Sanders |
| 2003 | Bicriteria approximation algorithms for scheduling problems with communications. Evripidis Bampis, Alexander V. Kononov |
| 2003 | Buffer overflows of merging streams. Alexander Kesselman, Yishay Mansour, Zvi Lotker, Boaz Patt-Shamir |
| 2003 | Can we elect if we cannot compare? Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
| 2003 | Combining online algorithms for rejection and acceptance. Yossi Azar, Avrim Blum, Yishay Mansour |
| 2003 | Compact routing with name independence. Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka |
| 2003 | Cycle stealing under immediate dispatch task assignment. Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante |
| 2003 | Designing overlay multicast networks for streaming. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman |
| 2003 | Efficient galois field arithmetic on SIMD architectures. Raghav Bhaskar, Pradeep K. Dubey, Vijay Kumar, Atri Rudra |
| 2003 | High throughput, parallelized 128-bit AES encryption in a resource-limited FPGA. Christopher Caltagirone, Kasi Anantha |
| 2003 | I/O-efficient topological sorting of planar DAGs. Lars Arge, Laura Toma, Norbert Zeh |
| 2003 | Improved approximation algorithms for the freeze-tag problem. Esther M. Arkin, Michael A. Bender, Dongdong Ge |
| 2003 | Information gathering in adversarial systems: lines and cycles. Kishore Kothapalli, Christian Scheideler |
| 2003 | Integrated prefetching and caching in single and parallel disk systems. Susanne Albers, Markus Büttner |
| 2003 | Load balancing of unit size tokens and expansion properties of graphs. Robert Elsässer, Burkhard Monien |
| 2003 | MAPO: using a committee of algorithm-experts for parallel optimization of costly functions. Christine A. Shoemaker, Rommel G. Regis |
| 2003 | MST construction in O(log log n) communication rounds. Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg |
| 2003 | Minimizing total flow time and total completion time with immediate dispatching. Nir Avrahami, Yossi Azar |
| 2003 | Nonblocking k-compare-single-swap. Victor Luchangco, Mark Moir, Nir Shavit |
| 2003 | Novel architectures for P2P applications: the continuous-discrete approach. Moni Naor, Udi Wieder |
| 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 | On local algorithms for topology control and routing in ad hoc networks. Lujun Jia, Rajmohan Rajaraman, Christian Scheideler |
| 2003 | Online deadline scheduling: multiple machines and randomization. Jae-Ha Lee |
| 2003 | Online oblivious routing. Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson |
| 2003 | Optimal fault-tolerant linear arrays. Toshinori Yamada, Shuichi Ueno |
| 2003 | Optimal sharing of bags of tasks in heterogeneous clusters. Micah Adler, Ying Gong, Arnold L. Rosenberg |
| 2003 | Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors. Géraud Krawezik |
| 2003 | Polynomial time algorithms for network information flow. Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen |
| 2003 | Quantifying instruction criticality for shared memory multiprocessors. Tong Li, Alvin R. Lebeck, Daniel J. Sorin |
| 2003 | Randomized permutations in a coarse grained parallel environment. Jens Gustedt |
| 2003 | Relaxing the problem-size bound for out-of-core columnsort. Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen |
| 2003 | SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003) Arnold L. Rosenberg, Friedhelm Meyer auf der Heide |
| 2003 | Scheduling policies for CIOQ switches. Alexander Kesselman, Adi Rosén |
| 2003 | Short length menger's theorem and reliable optical routing. Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman |
| 2003 | TCP is competitive against a limited adversary. Jeff Edmonds, Suprakash Datta, Patrick W. Dymond |
| 2003 | The complexity of verifying memory coherence. Jason F. Cantin, Mikko H. Lipasti, James E. Smith |
| 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 | The load rebalancing problem. Gagan Aggarwal, Rajeev Motwani, An Zhu |
| 2003 | Throughput-centric routing algorithm design. Brian Towles, William J. Dally, Stephen P. Boyd |
| 2003 | Toward a decidable notion of sequential consistency. Jesse D. Bingham, Anne Condon, Alan J. Hu |
| 2003 | Tree based MPLS routing. Anupam Gupta, Amit Kumar, Mikkel Thorup |
| 2003 | VLSI layout of trees into grids of minimum width. Akira Matsubayashi |
| 2003 | Worst case mobility in ad hoc networks. Christian Schindelhauer, Tamás Lukovszki, Stefan Rührup, Klaus Volbert |