default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th SPAA 2002: Winnipeg, Manitoba, Canada
- Arnold L. Rosenberg, Bruce M. Maggs:
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002. ACM 2002, ISBN 1-58113-529-7 - Brian Towles, William J. Dally:
Worst-case traffic for oblivious routing functions. 1-8 - Arjun Singh, William J. Dally, Brian Towles, Amit K. Gupta:
Locality-preserving randomized oblivious routing on torus networks. 9-13 - Costas Busch:
Õ(congestion + dilation) hot-potato routing on leveled networks. 20-29 - Matthias Westermann:
Distributed caching independent of the network size. 31-40 - Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao:
Distributed object location in a dynamic network. 41-52 - André Brinkmann, Kay Salzwedel, Christian Scheideler:
Compact, adaptive placement schemes for non-uniform requirements. 53-62 - Phillip B. Gibbons, Srikanta Tirthapura:
Distributed streams algorithms for sliding windows. 63-72 - Maged M. Michael:
High performance dynamic lock-free hash tables and list-based sets. 73-82 - Michela Taufer
, Thomas Stricker, Roger Weber:
Scalability and resource usage of an OLAP benchmark on clusters of PCs. 83-94 - Uzi Vishkin:
Two techniques for reconciling algorithm parallelism with memory constraints. 95-98 - Anasua Bhowmik, Manoj Franklin:
A general compiler framework for speculative multithreading. 99-108 - Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Optimal organizations for pipelined hierarchical memories. 109-116 - Gautam Gupta, Sanjay V. Rajopadhye, Patrice Quinton:
Scheduling reductions on realistic machines. 117-126 - Hui Wu, Joxan Jaffar:
Two processor scheduling with real release times and deadlines. 127-132 - Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To:
Extra processors versus future information in optimal deadline scheduling. 133-142 - Enoch Peserico:
The lazy adversary conjecture fails. 143-144 - Chi-Hsiang Yeh:
AT2L2 appr. equal N2/2 for fast fourier transform in multilayer VLSI. 145-146 - Jean-François Nezan, Olivier Déforges, Mickaël Raulet:
Rapid prototyping methodology for multi-DSP TI C6X platforms applied to an Mpeg-2 coding application. 147-148 - Frank Hannig, Jürgen Teich:
Energy estimation of nested loop programs. 149-150 - Michel Raynal:
Sequential consistency as lazy linearizability. 151-152 - Harold W. Cain, Mikko H. Lipasti:
Verifying sequential consistency using vector clocks. 153-154 - Ali Pinar, Bruce Hendrickson:
Exploiting flexibly assignable work to improve load balance. 155-163 - Danny Hendler, Nir Shavit:
Work dealing. 164-172 - Francisco Almeida, Rumen Andonov, Daniel González, Luz Marina Moreno, Vincent Poirriez, Casiano Rodríguez:
Optimal tiling for the RNA base pairing problem. 173-182 - Carme Àlvarez, Maria J. Blesa, Maria J. Serna:
Universal stability of undirected graphs in the adversarial queueing model. 183-197 - Zvi Lotker, Boaz Patt-Shamir, Adi Rosén:
New stability results for adversarial queuing. 192-199 - Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Capture of an intruder by mobile agents. 200-209 - Emmanuelle Anceaume, Jean-Michel Hélary, Michel Raynal:
Tracking immediate predecessors in distributed computations. 210-219 - Bogdan S. Chlebus, Dariusz R. Kowalski:
Gossiping to reach consensus. 220-229 - Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald:
Energy, congestion and dilation in radio networks. 230-237 - Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti:
Parallel scheduling problems in next generation wireless networks. 238-247 - Jeremy Brown, J. P. Grossman, Tom Knight:
A lightweight idempotent messaging protocol for faulty networks. 248-257 - Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest common ancestors: a survey and a new distributed algorithm. 258-264 - Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for fault-tolerant routing in circuit switched networks. 265-274 - Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne:
Parallel dynamic programming for solving the string editing problem on a CGM/BSP. 275-281 - Jop F. Sibeyn, James Abello, Ulrich Meyer:
Heuristics for semi-external depth first search on directed graphs. 282-292
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-28 01:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
