Abstract is missing.
- Worst-case traffic for oblivious routing functionsBrian Towles, William J. Dally. 1-8 [doi]
- Locality-preserving randomized oblivious routing on torus networksArjun Singh, William J. Dally, Brian Towles, Amit K. Gupta. 9-13 [doi]
- Õ(congestion + dilation) hot-potato routing on leveled networksCostas Busch. 20-29 [doi]
- Distributed object location in a dynamic networkKirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao. 41-52 [doi]
- Compact, adaptive placement schemes for non-uniform requirementsAndré Brinkmann, Kay Salzwedel, Christian Scheideler. 53-62 [doi]
- Distributed streams algorithms for sliding windowsPhillip B. Gibbons, Srikanta Tirthapura. 63-72 [doi]
- High performance dynamic lock-free hash tables and list-based setsMaged M. Michael. 73-82 [doi]
- Scalability and resource usage of an OLAP benchmark on clusters of PCsMichela Taufer, Thomas Stricker, Roger Weber. 83-94 [doi]
- Two techniques for reconciling algorithm parallelism with memory constraintsUzi Vishkin. 95-98 [doi]
- A general compiler framework for speculative multithreadingAnasua Bhowmik, Manoj Franklin. 99-108 [doi]
- Optimal organizations for pipelined hierarchical memoriesGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik. 109-116 [doi]
- Scheduling reductions on realistic machinesGautam Gupta, Sanjay V. Rajopadhye, Patrice Quinton. 117-126 [doi]
- Two processor scheduling with real release times and deadlinesHui Wu, Joxan Jaffar. 127-132 [doi]
- Extra processors versus future information in optimal deadline schedulingChiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To. 133-142 [doi]
- The lazy adversary conjecture failsEnoch Peserico. 143-144 [doi]
- AT:::2:::L:::2::: appr. equal N:::2:::/2 for fast fourier transform in multilayer VLSIChi-Hsiang Yeh. 145-146 [doi]
- Rapid prototyping methodology for multi-DSP TI C6X platforms applied to an Mpeg-2 coding applicationJean-François Nezan, Olivier Déforges, Mickaël Raulet. 147-148 [doi]
- Energy estimation of nested loop programsFrank Hannig, Jürgen Teich. 149-150 [doi]
- Sequential consistency as lazy linearizabilityMichel Raynal. 151-152 [doi]
- Verifying sequential consistency using vector clocksHarold W. Cain, Mikko H. Lipasti. 153-154 [doi]
- Exploiting flexibly assignable work to improve load balanceAli Pinar, Bruce Hendrickson. 155-163 [doi]
- Work dealingDanny Hendler, Nir Shavit. 164-172 [doi]
- Optimal tiling for the RNA base pairing problemFrancisco Almeida, Rumen Andonov, Daniel González, Luz Marina Moreno, Vincent Poirriez, Casiano Rodríguez. 173-182 [doi]
- Universal stability of undirected graphs in the adversarial queueing modelCarme Àlvarez, Maria J. Blesa, Maria J. Serna. 183-197 [doi]
- New stability results for adversarial queuingZvi Lotker, Boaz Patt-Shamir, Adi Rosén. 192-199 [doi]
- Capture of an intruder by mobile agentsLali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro. 200-209 [doi]
- Tracking immediate predecessors in distributed computationsEmmanuelle Anceaume, Jean-Michel Hélary, Michel Raynal. 210-219 [doi]
- Gossiping to reach consensusBogdan S. Chlebus, Dariusz R. Kowalski. 220-229 [doi]
- Energy, congestion and dilation in radio networksFriedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald. 230-237 [doi]
- Parallel scheduling problems in next generation wireless networksLuca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti. 238-247 [doi]
- A lightweight idempotent messaging protocol for faulty networksJeremy Brown, J. P. Grossman, Tom Knight. 248-257 [doi]
- Nearest common ancestors: a survey and a new distributed algorithmStephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe. 258-264 [doi]
- Algorithms for fault-tolerant routing in circuit switched networksAmitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman. 265-274 [doi]
- Parallel dynamic programming for solving the string editing problem on a CGM/BSPCarlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne. 275-281 [doi]
- Heuristics for semi-external depth first search on directed graphsJop F. Sibeyn, James Abello, Ulrich Meyer. 282-292 [doi]