2. SPAA 1990:
Island of Crete,
Greece
SPAA '90:
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures,
July 2-6,
1990,
Island of Crete,
Greece. ACM Press,
1990
- Frank Thomson Leighton:
Average Case Analysis of Greedy Routing algorithms on Arrays.
2-10
Electronic Edition (ACM DL) BibTeX
- Martin C. Herbordt, Charles C. Weems, James C. Corbett:
Message-Passing Algorithms for a SIMD Torus with Coteries.
11-20
Electronic Edition (ACM DL) BibTeX
- Smaragda Konstantinidou, Lawrence Snyder:
The Chaos Router: A Practical Application of Randomization in Network Routing.
21-30
Electronic Edition (ACM DL) BibTeX
- Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas:
Tight Bounds for Oblivious Routing in the Hypercube.
31-36
Electronic Edition (ACM DL) BibTeX
- Jehoshua Bruck, Robert Cypher, Danny Soroker:
Running Algorithms Efficiently on Faulty Hypercubes.
37-44
Electronic Edition (ACM DL) BibTeX
- David S. Greenberg, Sandeep N. Bhatt:
Routing Multiple Paths in Hypercubes.
45-54
Electronic Edition (ACM DL) BibTeX
- William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman:
Fast Algorithms for Bit-Serial Routing on a Hypercube.
55-64
Electronic Edition (ACM DL) BibTeX
- Richard J. Anderson, Paul Beame, Walter L. Ruzzo:
Low Overhead Parallel Schedules for Task Graphs.
66-75
Electronic Edition (ACM DL) BibTeX
- Naomi Nishimura:
Asynchronous Shared Memory Parallel Computation.
76-84
Electronic Edition (ACM DL) BibTeX
- Richard Cole, Ofer Zajicek:
The Expected Advantage of Asynchrony.
85-94
Electronic Edition (ACM DL) BibTeX
- Richard J. Anderson:
Parallel Algorithms for Generating Random Permutations on a Shared memory Machine.
95-102
Electronic Edition (ACM DL) BibTeX
- Jonathan F. Buss:
Processor Networks and Alternating Machines.
103-108
Electronic Edition (ACM DL) BibTeX
- Faith E. Fich, V. Ramachandran:
Lower Bounds for Parallel Computation on Linked Structures.
109-116
Electronic Edition (ACM DL) BibTeX
- Torben Hagerup, Tomasz Radzik:
Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM.
117-124
Electronic Edition (ACM DL) BibTeX
- Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes.
125-135
Electronic Edition (ACM DL) BibTeX
- Mark Shand, Patrice Bertin, Jean Vuillemin:
Hardware Speedups in Long Integer Multiplication.
138-145
Electronic Edition (ACM DL) BibTeX
- Bernd Becker, Joachim Hartmann:
Optimal-Time Multipliers and C-Testability.
146-154
Electronic Edition (ACM DL) BibTeX
- Manu Thapar, Bruce Delagi:
Cache Coherence for Large Scale Shared Memory Multiprocessors.
155-160
Electronic Edition (ACM DL) BibTeX
- Peter Grabienski:
FLIP-FLOP: A Stack-Oriented Multiprocessing System.
161-168
Electronic Edition (ACM DL) BibTeX
- Rafael H. Saavedra-Barrera, David E. Culler, Thorsten von Eicken:
Analysis of Multithreaded Architectures for Parallel Computing.
169-178
Electronic Edition (ACM DL) BibTeX
- Harrick M. Vin, Francine Berman:
Architectural Support for the Efficient Data-Driven Evaluation Scheme.
179-187
Electronic Edition (ACM DL) BibTeX
- C. Maples:
Utilizing Virtual Shared Memory in a Topology Independent, Multicomputer Environment.
188-198
Electronic Edition (ACM DL) BibTeX
- Jeffrey D. Ullman, Mihalis Yannakakis:
High-Probability Parallel Transitive Closure Algorithms.
200-209
Electronic Edition (ACM DL) BibTeX
- Hillel Gazit, John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism.
210-219
Electronic Edition (ACM DL) BibTeX
- Dario Bini, Fabio Di Benedetto:
A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems.
220-223
Electronic Edition (ACM DL) BibTeX
- Martin L. Brady, Donna J. Brown, P. McGuinness:
Disjoint Paths Through a 3-Dimensional Grid.
224-233
Electronic Edition (ACM DL) BibTeX
- David G. Kirkpatrick, Teresa M. Przytycka:
Parallel Construction of near Optimal binary Trees.
234-243
Electronic Edition (ACM DL) BibTeX
- Victor Y. Pan:
Parallel Least-Squares Solution of General and Toeplitz Systems.
244-253
Electronic Edition (ACM DL) BibTeX
- Dario Bini, Luca Gemignani:
On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros.
254-258
Electronic Edition (ACM DL) BibTeX
- Alok Aggarwal, Dina Kravets, James K. Park, S. Sen:
Parallel Searching in Generalized Monge Arrays with Applications.
259-268
Electronic Edition (ACM DL) BibTeX
- Mikhail J. Atallah, Danny Z. Chen:
Parallel Rectilinear Shortest Paths with Rectangular Obstacles.
270-279
Electronic Edition (ACM DL) BibTeX
- Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright:
Generalized Sweep Methods for Parallel Computational Geometry.
280-289
Electronic Edition (ACM DL) BibTeX
- Torben Hagerup, H. Jung, Emo Welzl:
Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions.
290-297
Electronic Edition (ACM DL) BibTeX
- Richard J. Anderson, Paul Beame, Erik Brisson:
Parallel Algorithms for Arrangements.
298-306
Electronic Edition (ACM DL) BibTeX
- Roberto Tamassia, Jeffrey Scott Vitter:
Optimal Cooperative Search in Fractional Cascaded Data Structures.
307-316
Electronic Edition (ACM DL) BibTeX
- Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich:
P-Complete Geometric Problems.
317-326
Electronic Edition (ACM DL) BibTeX
- John H. Reif, Sandeep Sen:
Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications.
327-339
Electronic Edition (ACM DL) BibTeX
- James Aspnes, Maurice Herlihy:
Wait-Free Data Structures in the Asynchronous PRAM Model.
340-349
Electronic Edition (ACM DL) BibTeX
- Beth Simon, D. Alpern, Jeanne Ferrante:
A Foundation for Sequentializing Parallel Code.
350-359
Electronic Edition (ACM DL) BibTeX
- Björn Lisper:
Preconditioning Index Set Transformations for Time-Optimal Affine Scheduling.
360-366
Electronic Edition (ACM DL) BibTeX
- Vwani P. Roychowdhury, Thomas Kailath:
Study of Parallelism in Regular Iterative Algorithms.
367-376
Electronic Edition (ACM DL) BibTeX
- Yuh-Dauh Lyuu:
Fast-Fault-Tolerant Parallel Communication and On-Line Maintenance Using Information Dispersal.
378-387
Electronic Edition (ACM DL) BibTeX
- Eric J. Schwabe:
On the Computational Equivalence of Hypercube-Derived Networks.
388-397
Electronic Edition (ACM DL) BibTeX
- Fred S. Annexstein, Marc Baumslag:
A Unified Approach to Off-Line Permutation Routing on Parallel Networks.
398-406
Electronic Edition (ACM DL) BibTeX
- Kieran T. Herley:
Space-Efficient Representations of Shared Data for Parallel Computers.
407-416
Electronic Edition (ACM DL) BibTeX
Copyright © Wed Jun 4 18:56:21 2008
by Michael Ley (ley@uni-trier.de)
