- 2002
- Francisco Almeida, Rumen Andonov, Daniel González, Luz Marina Moreno, Vincent Poirriez, Casiano Rodríguez:
Optimal tiling for the RNA base pairing problem. SPAA 2002: 173-182 - Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002: 258-264 - Carme Àlvarez, Maria J. Blesa, Maria J. Serna:
Universal stability of undirected graphs in the adversarial queueing model. SPAA 2002: 183-197 - 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. SPAA 2002: 275-281 - Emmanuelle Anceaume, Jean-Michel Hélary, Michel Raynal:
Tracking immediate predecessors in distributed computations. SPAA 2002: 210-219 - Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for fault-tolerant routing in circuit switched networks. SPAA 2002: 265-274 - Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Capture of an intruder by mobile agents. SPAA 2002: 200-209 - Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti:
Parallel scheduling problems in next generation wireless networks. SPAA 2002: 238-247 - Anasua Bhowmik, Manoj Franklin:
A general compiler framework for speculative multithreading. SPAA 2002: 99-108 - Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik:
Optimal organizations for pipelined hierarchical memories. SPAA 2002: 109-116 - André Brinkmann, Kay Salzwedel, Christian Scheideler:
Compact, adaptive placement schemes for non-uniform requirements. SPAA 2002: 53-62 - Jeremy Brown, J. P. Grossman, Tom Knight:
A lightweight idempotent messaging protocol for faulty networks. SPAA 2002: 248-257 - Costas Busch:
Õ(congestion + dilation) hot-potato routing on leveled networks. SPAA 2002: 20-29 - Harold W. Cain, Mikko H. Lipasti:
Verifying sequential consistency using vector clocks. SPAA 2002: 153-154 - Bogdan S. Chlebus, Dariusz R. Kowalski:
Gossiping to reach consensus. SPAA 2002: 220-229 - Phillip B. Gibbons, Srikanta Tirthapura:
Distributed streams algorithms for sliding windows. SPAA 2002: 63-72 - Gautam Gupta, Sanjay V. Rajopadhye, Patrice Quinton:
Scheduling reductions on realistic machines. SPAA 2002: 117-126 - Frank Hannig, Jürgen Teich:
Energy estimation of nested loop programs. SPAA 2002: 149-150 - Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald:
Energy, congestion and dilation in radio networks. SPAA 2002: 230-237 - Danny Hendler, Nir Shavit:
Work dealing. SPAA 2002: 164-172 - Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao:
Distributed object location in a dynamic network. SPAA 2002: 41-52 - Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To:
Extra processors versus future information in optimal deadline scheduling. SPAA 2002: 133-142 - Zvi Lotker, Boaz Patt-Shamir, Adi Rosén:
New stability results for adversarial queuing. SPAA 2002: 192-199 - Maged M. Michael:
High performance dynamic lock-free hash tables and list-based sets. SPAA 2002: 73-82 - 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. SPAA 2002: 147-148 - Enoch Peserico:
The lazy adversary conjecture fails. SPAA 2002: 143-144 - Ali Pinar, Bruce Hendrickson:
Exploiting flexibly assignable work to improve load balance. SPAA 2002: 155-163 - Michel Raynal:
Sequential consistency as lazy linearizability. SPAA 2002: 151-152 - Jop F. Sibeyn, James Abello, Ulrich Meyer:
Heuristics for semi-external depth first search on directed graphs. SPAA 2002: 282-292 - Arjun Singh, William J. Dally, Brian Towles, Amit K. Gupta:
Locality-preserving randomized oblivious routing on torus networks. SPAA 2002: 9-13