|
|
Conferences in DBLP
- Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:1-12 [Conf]
- Charles E. Leiserson, Keith H. Randall
Parallel Algorithms for the Circuit Value Update Problem. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:13-20 [Conf]
- Martin E. Dyer, Jonathan M. Nash, Peter M. Dew
An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:21-26 [Conf]
- 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. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:27-33 [Conf]
- Seungjoon Park, David L. Dill
An Executable Specification, Analyzer and Verifier for RMO (Relaxed Memory Order). [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:34-41 [Conf]
- Eric A. Brewer, Frederic T. Chong, Lok T. Liu, Shamik D. Sharma, John Kubiatowicz
Remote Queues: Exposing Message Queues for Pptimization and Atomicity. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:42-53 [Conf]
- Nir Shavit, Dan Touitou
Elimination Trees and the Construction of Pools and Stacks (Preliminary Version). [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:54-63 [Conf]
- 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. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:64-73 [Conf]
- Soumen Chakrabarti, James Demmel, Katherine A. Yelick
Modeling the Benefits of Mixed Data and Task Parallelism. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:74-83 [Conf]
- Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:84-94 [Conf]
- 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. [Citation Graph (1, 0)][DBLP]
SPAA, 1995, pp:95-105 [Conf]
- Frank Thomson Leighton, Yuan Ma, Torsten Suel
On Probabilistic Networks for Selection, Merging, and Sorting. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:106-118 [Conf]
- Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka
Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:119-128 [Conf]
- Micah Adler, John W. Byers, Richard M. Karp
Parallel Sorting with Limited Bandwidth. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:129-136 [Conf]
- Friedhelm Meyer auf der Heide, Christian Scheideler
Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:137-146 [Conf]
- Robert Cypher
The Communication Requirements of Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:147-156 [Conf]
- Vara Ramakrishnan, Isaac D. Scherson, Raghu Subramanian
Efficient Techniques for Fast Nested Barrier Synchronization. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:157-164 [Conf]
- Jerry Stamatopoulos, Jon A. Solworth
Universal Congestion Control for Meshes. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:165-174 [Conf]
- Loren Schwiebert, D. N. Jayasimha
A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:175-184 [Conf]
- Gianfranco Bilardi, Franco P. Preparata
Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:185-194 [Conf]
- Ronald I. Greenberg
Finding Connected Components on a Scan Line Array Processor. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:195-202 [Conf]
- C. R. M. Sundaram, Derek L. Eager
Future Applicability of Bus-Based Shared Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:203-212 [Conf]
- John H. Reif
Parallel Molecular Computation. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:213-223 [Conf]
- Ka Wong Chong, Tak Wah Lam
Approximating Biconnectivity in Parallel. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:224-233 [Conf]
- Fred S. Annexstein, Ramjee P. Swaminathan
On Testing Consecutive-Ones Property in Parallel. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:234-243 [Conf]
- Martin Farach, S. Muthukrishnan
Optimal Parallel Dictionary Matching and Compression (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:244-253 [Conf]
- Philip D. MacKenzie
Lower Bounds for Randomized Exclusive Write PRAMs. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:254-263 [Conf]
- Dannie Durand, Ravi Jain, David Tseytlin
Applying Randomized Edge Coloring Algorithms to Distributed Communication: An Experimental Study. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:264-274 [Conf]
- Ted Nesson, S. Lennart Johnsson
ROMM Routing on Mesh and Torus Networks. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:275-287 [Conf]
- Thomas H. Cormen, Kristin Bruhl
Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:288-297 [Conf]
- Sunil Kim, Alexander V. Veidenbaum
On Shortest Path Routing in Single Stage Shuffle-Exchange Networks. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:298-307 [Conf]
|
