List of accepted papers for SPAA 2002:


Worst-case Traffic for Oblivous Routing Functions
B. Towles, W. J. Dally

Locality-Preserving Randomized Oblivious Routing on Torus Networks
A. Singh, W. Dally, B. Towles, A. K. Gupta

~O(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
C. Busch

Distributed Caching Independent of the Network Size
M. Westermann

Distribted Data Location in a Dynamic Network
K. Hildrum, J. D. Kubiatowicz, S. Rao, B. Y. Zhao

Compact, adaptive placement schemes for non-uniform distribution requirements
A. Brinkmann, K. Salzwedel, C. Scheideler

Distributed Streams Algorithms for Sliding Windows
P. B. Gibbons, S. Tirthapura

High Performance Dynamic Lock-Free Hash Tables and List-Based Sets
M. M. Michael

Scalability and Resource Usage of an OLAP Benchmark on Clusters of PCs
M. Taufer, T. Stricker, R. Weber

Two Techniques for Reconciling Algorithm Parallelism with Memory Constraints
U. Vishkin

A General Compiler Framework for Speculative Multithreading
A. Bhowmik, M. Franklin

Optimal Organizations for Pipelined Hierarchical Memories
G. Bilardi, K. Ekanadham, P. Pattnaik

Scheduling Reductions on Realistic Machines
Gautam , S. Rajopadhye, P. Quinton

Two Processor Scheduling with Real Release Times and Deadlines
H. Wu, J. Jaffar

Extra Processors versus Future Information in Optimal Deadline Scheduling
C.Y. Koo, T.W. Lam, J. Ngan, K.K. To

The Lazy Adversary Conjecture Fails
E. Peserico

AT^2L^2 = N^2/2 for Fast Fourier Transform in Multilayer VLSI
C.-H. Yeh

Rapid Prototyping Methodology For multi-DSP TI C6X Platforms
J.F. Nezan, O. Deforges, M. Raulet

Energy Estimation of Nested Loop Programs
F. Hannig, J. Teich

Sequential Consistency as Lazy Linearizability
M. Raynal

Vector Clocks, Constraint Graphs, and Verification of Memory Consistency Models
H. W. Cain, M. H. Lipasti

Exploiting Flexibly Assignable Work to Improve Load Balance
A.Pinar, B. Hendrickson

Work Dealing
D. Hendler, N. Shavit

Optimal tiling for the RNA base pairing problem
F. Almeida, R. Andonov, D. Gonzolez, L.M. Moreno, V. Poirriez, C.  Rodriguez

Universal stability of undirected graphs in the adversarial queueing model
C. Alvarez, M. Blesa, M. Serna

New Stability Results for Adversarial Queuing
Z. Lotker, B. Patt-Shamir, A. Rosen

Capture of an Intruder by Mobile Agents
L. Barriere, P. Flocchini, P. Fraigniaud, N. Santoro

Tracking Immediate Predecessors in Distributed Computations
E. Anceaume, J.-M. Helary, M. Raynal

Gossiping to Reach Consensus
B. S. Chlebus, D. R. Kowalski

Energy, Congestion, and Dilation in Radio Networks
F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grunewald

Parallel Scheduling in Next Generation Wireless Networks
L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T. Nandagopal, A. Vitaletti

A Lightweight Idempotent Messaging Protocol for Faulty Networks
J. Brown, J.P. Grossman, T. Knight

Nearest Common Ancestors: A survey and a new distributed algorithm
S. Alstrup, C. Gavoille, H. Kaplan, T. Raulie

Algorithms for Fault-Tolerant Routing in Circuit Switched Networks
A. Bagchi, A. Chaudhary, P. Kolman, C. Scheideler

Parallel Dynamic Programming For Solving The String Editing Problem on a CGM/BSP
C. E. R. Alves, E. N. Caceres, F. Dehne, S. W. Song

Heuristics for Semi-External Depth First Search on Directed Graphs
J. F. Sibeyn, J. Abello, U. C. Meyer