7. SPAA 1995:
Santa Barbara, California, USA
SPAA '95:
7th Annual ACM Symposium on Parallel Algorithms and Architectures, July 17-19, 1995, Santa Barbara, California, USA. ACM Press, 1995, ISBN 0-89791-717-0
- Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias:
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism.
1-12

- Charles E. Leiserson, Keith H. Randall:
Parallel Algorithms for the Circuit Value Update Problem.
13-20

- Martin E. Dyer, Jonathan M. Nash, Peter M. Dew:
An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance.
21-26

- Frank K. H. A. Dehne, Xiaotie Deng, Patrick W. Dymond, Andreas Fabri, Ashfaq A. Khokhar:
A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers.
27-33

- Seungjoon Park, David L. Dill:
An Executable Specification, Analyzer and Verifier for RMO (Relaxed Memory Order).
34-41

- Eric A. Brewer, Frederic T. Chong, Lok T. Liu, Shamik D. Sharma, John Kubiatowicz:
Remote Queues: Exposing Message Queues for Pptimization and Atomicity.
42-53

- Nir Shavit, Dan Touitou:
Elimination Trees and the Construction of Pools and Stacks (Preliminary Version).
54-63

- Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Marcel-Catalin Rosu, H. Raymond Strong:
Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations.
64-73

- Soumen Chakrabarti, James Demmel, Katherine A. Yelick:
Modeling the Benefits of Mixed Data and Task Parallelism.
74-83

- Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha:
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors.
84-94

- Albert Alexandrov, Mihai F. Ionescu, Klaus E. Schauser, Chris J. Scheiman:
LogGP: Incorporating Long Messages into the LogP Model - One Step Closer Towards a Realistic Model for Parallel Computation.
95-105

- Frank Thomson Leighton, Yuan Ma, Torsten Suel:
On Probabilistic Networks for Selection, Merging, and Sorting.
106-118

- Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka:
Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks.
119-128

- Micah Adler, John W. Byers, Richard M. Karp:
Parallel Sorting with Limited Bandwidth.
129-136

- Friedhelm Meyer auf der Heide, Christian Scheideler:
Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).
137-146

- Robert Cypher:
The Communication Requirements of Mutual Exclusion.
147-156

- Vara Ramakrishnan, Isaac D. Scherson, Raghu Subramanian:
Efficient Techniques for Fast Nested Barrier Synchronization.
157-164

- Jerry Stamatopoulos, Jon A. Solworth:
Universal Congestion Control for Meshes.
165-174

- Loren Schwiebert, D. N. Jayasimha:
A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks.
175-184

- Gianfranco Bilardi, Franco P. Preparata:
Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation.
185-194

- Ronald I. Greenberg:
Finding Connected Components on a Scan Line Array Processor.
195-202

- C. R. M. Sundaram, Derek L. Eager:
Future Applicability of Bus-Based Shared Memory Multiprocessors.
203-212

- John H. Reif:
Parallel Molecular Computation.
213-223

- Ka Wong Chong, Tak Wah Lam:
Approximating Biconnectivity in Parallel.
224-233

- Fred S. Annexstein, Ramjee P. Swaminathan:
On Testing Consecutive-Ones Property in Parallel.
234-243

- Martin Farach, S. Muthukrishnan:
Optimal Parallel Dictionary Matching and Compression (Extended Abstract).
244-253

- Philip D. MacKenzie:
Lower Bounds for Randomized Exclusive Write PRAMs.
254-263

- Dannie Durand, Ravi Jain, David Tseytlin:
Applying Randomized Edge Coloring Algorithms to Distributed Communication: An Experimental Study.
264-274

- Ted Nesson, S. Lennart Johnsson:
ROMM Routing on Mesh and Torus Networks.
275-287

- Thomas H. Cormen, Kristin Bruhl:
Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2.
288-297

- Sunil Kim, Alexander V. Veidenbaum:
On Shortest Path Routing in Single Stage Shuffle-Exchange Networks.
298-307

Last update Sat May 18 19:49:30 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page