Abstract is missing.
- Optimal sharing of bags of tasks in heterogeneous clustersMicah Adler, Ying Gong, Arnold L. Rosenberg. 1-10 [doi]
- Minimizing total flow time and total completion time with immediate dispatchingNir Avrahami, Yossi Azar. 11-18 [doi]
- Online deadline scheduling: multiple machines and randomizationJae-Ha Lee. 19-23 [doi]
- A practical algorithm for constructing oblivious routing schemesMarcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke. 24-33 [doi]
- A polynomial-time tree decomposition to minimize congestionChris Harrelson, Kirsten Hildrum, Satish Rao. 34-43 [doi]
- Online oblivious routingNikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson. 44-49 [doi]
- Novel architectures for P2P applications: the continuous-discrete approachMoni Naor, Udi Wieder. 50-59 [doi]
- Optimal fault-tolerant linear arraysToshinori Yamada, Shuichi Ueno. 60-64 [doi]
- The effect of communication costs in solid-state quantum computing architecturesDean Copsey, Mark Oskin, Tzvetan S. Metodi, Frederic T. Chong, Isaac L. Chuang, John Kubiatowicz. 65-74 [doi]
- VLSI layout of trees into grids of minimum widthAkira Matsubayashi. 75-84 [doi]
- I/O-efficient topological sorting of planar DAGsLars Arge, Laura Toma, Norbert Zeh. 85-93 [doi]
- MST construction in O(log log n) communication roundsZvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg. 94-100 [doi]
- A proportionate fair scheduling rule with good worst-case performanceMicah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson. 101-108 [doi]
- Integrated prefetching and caching in single and parallel disk systemsSusanne Albers, Markus Büttner. 109-117 [doi]
- Performance comparison of MPI and three openMP programming styles on shared memory multiprocessorsGéraud Krawezik. 118-127 [doi]
- Quantifying instruction criticality for shared memory multiprocessorsTong Li, Alvin R. Lebeck, Daniel J. Sorin. 128-137 [doi]
- Asynchronous parallel disk sortingRoman Dementiev, Peter Sanders. 138-148 [doi]
- Designing overlay multicast networks for streamingKonstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman. 149-158 [doi]
- Combining online algorithms for rejection and acceptanceYossi Azar, Avrim Blum, Yishay Mansour. 159-163 [doi]
- Off-line and on-line guaranteed start-up delay for media-on-demand with stream mergingAmotz Bar-Noy, Justin Goshi, Richard E. Ladner. 164-173 [doi]
- TCP is competitive against a limited adversaryJeff Edmonds, Suprakash Datta, Patrick W. Dymond. 174-183 [doi]
- Compact routing with name independenceMarta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka. 184-192 [doi]
- Tree based MPLS routingAnupam Gupta, Amit Kumar, Mikkel Thorup. 193-199 [doi]
- Throughput-centric routing algorithm designBrian Towles, William J. Dally, Stephen P. Boyd. 200-209 [doi]
- Analysis of link reversal routing algorithms for mobile ad hoc networksCostas Busch, Srikanth Surapaneni, Srikanta Tirthapura. 210-219 [doi]
- On local algorithms for topology control and routing in ad hoc networksLujun Jia, Rajmohan Rajaraman, Christian Scheideler. 220-229 [doi]
- Worst case mobility in ad hoc networksChristian Schindelhauer, Tamás Lukovszki, Stefan Rührup, Klaus Volbert. 230-239 [doi]
- High throughput, parallelized 128-bit AES encryption in a resource-limited FPGAChristopher Caltagirone, Kasi Anantha. 240-241 [doi]
- MAPO: using a committee of algorithm-experts for parallel optimization of costly functionsChristine A. Shoemaker, Rommel G. Regis. 242-243 [doi]
- Buffer overflows of merging streamsAlexander Kesselman, Yishay Mansour, Zvi Lotker, Boaz Patt-Shamir. 244-245 [doi]
- Short length menger s theorem and reliable optical routingAmitabha Bagchi, Amitabh Chaudhary, Petr Kolman. 246-247 [doi]
- Randomized permutations in a coarse grained parallel environmentJens Gustedt. 248-249 [doi]
- Relaxing the problem-size bound for out-of-core columnsortGeeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen. 250-251 [doi]
- Bicriteria approximation algorithms for scheduling problems with communicationsEvripidis Bampis, Alexander Kononov. 252-253 [doi]
- The complexity of verifying memory coherenceJason F. Cantin, Mikko H. Lipasti, James E. Smith. 254-255 [doi]
- Efficient galois field arithmetic on SIMD architecturesRaghav Bhaskar, Pradeep K. Dubey, Vijay Kumar, Atri Rudra. 256-257 [doi]
- The load rebalancing problemGagan Aggarwal, Rajeev Motwani, An Zhu. 258-265 [doi]
- Load balancing of unit size tokens and expansion properties of graphsRobert Elsässer, Burkhard Monien. 266-273 [doi]
- Cycle stealing under immediate dispatch task assignmentMor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante. 274-285 [doi]
- Polynomial time algorithms for network information flowPeter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen. 286-294 [doi]
- Improved approximation algorithms for the freeze-tag problemEsther M. Arkin, Michael A. Bender, Dongdong Ge. 295-303 [doi]
- Toward a decidable notion of sequential consistencyJesse D. Bingham, Anne Condon, Alan J. Hu. 304-313 [doi]
- Nonblocking k-compare-single-swapVictor Luchangco, Mark Moir, Nir Shavit. 314-323 [doi]
- Can we elect if we cannot compare?Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro. 324-332 [doi]
- Information gathering in adversarial systems: lines and cyclesKishore Kothapalli, Christian Scheideler. 333-342 [doi]
- A near optimal scheduler for switch-memory-switch routersAdnan Aziz, Amit Prakash, Vijaya Ramachandran. 343-352 [doi]
- Scheduling policies for CIOQ switchesAlexander Kesselman, Adi Rosén. 353-362 [doi]