Skip to content

Symposium on Parallelism in Algorithms and Architectures

SPAA

B

CORE rank

CORE rank (raw)

B

Fields of research

Distributed Computing and Systems Software

Papers indexed

1,688

1989–2026

Papers per year

198968 peak2026

SPAA papers

1,688 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1992Robust Bounded-Degree Networks with Small Diameters.Hisao Tamaki
1992Designing Synchronous Algorithms for Asynchronous Processors.Ramesh Subramonian
1992Supporting the Hypercube Programming Model on Mesh Architectures: A Fast Sorter for iWarp Tori.Thomas Stricker
1992Maintaining Dynamic Ordered Sets on Processor Networks.Abhiram G. Ranade
1992A Lower Bound for Sorting Networks Based on the Shuffle Permutation.C. Greg Plaxton, Torsten Suel
1992Fault-Tolerant Circuit-Switching Networks.Nicholas Pippenger, Geng Lin
1992Supereffective Slow-Down of Parallel Computations.Victor Y. Pan, Franco P. Preparata
1992Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel Algorithm.B. Narendran, Prasoon Tiwari
1992Optimal Routing of Parentheses on the Hypercube.Ernst W. Mayr, Ralph Werchner
1992The Network Architecture of the Connection Machine CM-5 (Extended Abstract).Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak
1992Matching the Bisection Bound for Routing and Sorting on the Mesh.Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn
1992Fast Connected Components Algorithms for the EREW PRAM.David R. Karger, Noam Nisan, Michal Parnas
1992Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors.Christos Kaklamanis, Giuseppe Persiano
1992Simple Path Selection for Optimal Routing on Processor Arrays.Christos Kaklamanis, Danny Krizanc, Satish Rao
1992Optimal Sorting on Mesh-Connected Processor Arrays.Christos Kaklamanis, Danny Krizanc
1992A Parallel Algorithm for Computing Minimum Spanning Trees.Donald B. Johnson, Panagiotis Takis Metaxas
1992Implementations of Randomized Sorting on Large Parallel Machines.William L. Hightower, Jan F. Prins, John H. Reif
1992Low Contention Load Balancing on Large-Scale Multiprocessors.Maurice Herlihy, Beng-Hong Lim, Nir Shavit
1992Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs.Yijie Han, Victor Y. Pan, John H. Reif
1992Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer.Susanne E. Hambrusch, Xin He, Russ Miller
1992A Contraction Procedure for Planar Directed Graphs.Stephen Guattery, Gary L. Miller
1992Connected Components and the Interval Graph.Edward F. Grove
1992Dense Edge-Disjoint Embedding of Binary Trees in the Mesh.Alan Gibbons, Mike Paterson
1992Specifying Non-Blocking Shared Memories (Extended Abstract).Phillip B. Gibbons, Michael Merritt
1992Efficient Optical Communication in Parallel Computers.Mihly Gerb-Graus, Thanasis Tsantilas
1,5261,550 of 1,688← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.