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