Conferences in DBLP

ACM Symposium on Parallel Algorithms and Architectures (SPAA) (spaa)
1991 (conf/spaa/91)

1. Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
   A Comparison of Sorting Algorithms for the Connection Machine CM-2. [Citation Graph (1, 0)][DBLP]
   SPAA, 1991, pp:3-16 [Conf]
   
2. Christos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas
   Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version). [Citation Graph (0, 0)][DBLP]
   SPAA, 1991, pp:17-28 [Conf]
   
3. Mark H. Nodine, Jeffrey Scott Vitter
   Large-Scale Sorting in Parallel Memories (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   SPAA, 1991, pp:29-39 [Conf]
   
4. Abhiram G. Ranade
   Optimal Speedup for Backtrack Search on a butterfly Network. [Citation Graph (0, 0)][DBLP]
   SPAA, 1991, pp:40-48 [Conf]
   
5. Holger Bast, Torben Hagerup
   Fast and Reliable Parallel Hashing. [Citation Graph (0, 0)][DBLP]
   SPAA, 1991, pp:50-61 [Conf]
   
6. Shiva Chaudhuri
   Tight Bounds for the Chaining Problem. [Citation Graph (0, 0)][DBLP]
   SPAA, 1991, pp:62-70 [Conf]
   
7. Lawrence L. Larmore, Teresa M. Przytycka
   Parallel Construction of Trees with Optimal Weighted Path Length. [Citation Graph (0, 0)][DBLP]
   SPAA, 1991, pp:71-80 [Conf]
   
8. Thomas H. Spencer
   More Time-Work Tradeoffs for Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP]
   SPAA, 1991, pp:81-93 [Conf]
   
9. Richard N. Draper
   An Overview of Supertoroidal Networks. [Citation Graph (0, 0)][DBLP]
   SPAA, 1991, pp:95-102 [Conf]
   
10. Joonwon Lee, Umakishore Ramachandran
    Architectural Primitives for a Scalable Shared Memory Multiprocessor. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:103-114 [Conf]
    
11. Fung F. Lee, Michael J. Flynn
    Architectural Mechanisms to Support Three-Dimensional Lattice Gas Simulations. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:115-122 [Conf]
    
12. B. Aiello, Frank Thomson Leighton
    Coding Theory, Hypercube Embeddings, and Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:125-136 [Conf]
    
13. Bojana Obrenic
    Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:137-146 [Conf]
    
14. Burkhard Monien
    Simulating Binary Trees on X-Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:147-158 [Conf]
    
15. Bojana Obrenic
    An Approach to Emulating Separable Graphs (preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:159-167 [Conf]
    
16. Michael T. Goodrich
    Constructing Arrangements Optimally in Parallel (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:169-179 [Conf]
    
17. Erich Kaltofen, Victor Y. Pan
    Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:180-191 [Conf]
    
18. Mujtaba R. Ghouse, Michael T. Goodrich
    In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:192-203 [Conf]
    
19. Mikhail J. Atallah, Frank K. H. A. Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay
    Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:204-214 [Conf]
    
20. G. N. Srinivasa Prasanna, Bruce R. Musicus
    Generalised Multiprocessor Scheduling Using Optimal Control. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:216-228 [Conf]
    
21. Maurice Herlihy, J. Eliot B. Moss
    Lock-Free garbage Collection for Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:229-236 [Conf]
    
22. Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal
    A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:237-245 [Conf]
    
23. George D. Stamoulis, John N. Tsitsiklis
    The Efficiency of Greedy Routing in Hypercubes and Butterflies. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:248-259 [Conf]
    
24. Manfred Kunde
    Balanced Routing: Towards the Distance Bound on Grids. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:260-271 [Conf]
    
25. Geng Lin, Nicholas Pippenger
    Parallel Algorithms for Routing in Non-Blocking Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:272-277 [Conf]
    
26. Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz
    Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:278-290 [Conf]
    
27. Phillip B. Gibbons, Michael Merritt, Kourosh Gharachorloo
    Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:292-303 [Conf]
    
28. Hagit Attiya, Jennifer L. Welch
    Sequential Consistency Versus Linearizability (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:304-315 [Conf]
    
29. Kourosh Gharachorloo, Phillip B. Gibbons
    Detecting Violations of Sequential Consistency. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:316-326 [Conf]
    
30. Maurice Herlihy
    Impossibility Results for Asynchronous PRAM (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:327-336 [Conf]
    
31. Marios C. Papaefthymiou
    Understanding Retiming Through Maximum Average-Weight Cycles. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:338-348 [Conf]
    
32. Matthias F. M. Stallmann
    A One-Way Array Algorithm for Matroid Scheduling. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:349-356 [Conf]
    
33. Shimon Even, Ami Litman
    On the Capabilities of Systolic Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:357-367 [Conf]