SPAA B

46 papers

YearTitle / Authors
1990A Foundation for Sequentializing Parallel Code.
Barbara Simons, David Alpern, Jeanne Ferrante
1990A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems.
Dario Bini, Fabio Di Benedetto
1990A Randomized Parallel Algorithm for Planar Graph Isomorphism.
Hillel Gazit, John H. Reif
1990A Unified Approach to Off-Line Permutation Routing on Parallel Networks.
Fred S. Annexstein, Marc Baumslag
1990Analysis of Multithreaded Architectures for Parallel Computing.
Rafael H. Saavedra-Barrera, David E. Culler, Thorsten von Eicken
1990Architectural Support for the Efficient Data-Driven Evaluation Scheme.
Harrick M. Vin, Francine Berman
1990Asynchronous Shared Memory Parallel Computation.
Naomi Nishimura
1990Average Case Analysis of Greedy Routing algorithms on Arrays.
Frank Thomson Leighton
1990Cache Coherence for Large Scale Shared Memory Multiprocessors.
Manu Thapar, Bruce Delagi
1990Disjoint Paths Through a 3-Dimensional Grid.
Martin L. Brady, Donna J. Brown, P. McGuinness
1990Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions.
Torben Hagerup, H. Jung, Emo Welzl
1990Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM.
Torben Hagerup, Tomasz Radzik
1990Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes.
Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
1990FLIP-FLOP: A Stack-Oriented Multiprocessing System.
Peter Grabienski
1990Fast Algorithms for Bit-Serial Routing on a Hypercube.
William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman
1990Fast-Fault-Tolerant Parallel Communication and On-Line Maintenance Using Information Dispersal.
Yuh-Dauh Lyuu
1990Generalized Sweep Methods for Parallel Computational Geometry.
Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright
1990Hardware Speedups in Long Integer Multiplication.
Mark Shand, Patrice Bertin, Jean Vuillemin
1990High-Probability Parallel Transitive Closure Algorithms.
Jeffrey D. Ullman, Mihalis Yannakakis
1990Low Overhead Parallel Schedules for Task Graphs.
Richard J. Anderson, Paul Beame, Walter L. Ruzzo
1990Lower Bounds for Parallel Computation on Linked Structures.
Faith E. Fich, Vijaya Ramachandran
1990Message-Passing Algorithms for a SIMD Torus with Coteries.
Martin C. Herbordt, Charles C. Weems, James C. Corbett
1990On the Computational Equivalence of Hypercube-Derived Networks.
Eric J. Schwabe
1990On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros.
Dario Bini, Luca Gemignani
1990Optimal Cooperative Search in Fractional Cascaded Data Structures.
Roberto Tamassia, Jeffrey Scott Vitter
1990Optimal-Time Multipliers and C-Testability.
Bernd Becker, Joachim Hartmann
1990P-Complete Geometric Problems.
Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich
1990Parallel Algorithms for Arrangements.
Richard J. Anderson, Paul Beame, Erik Brisson
1990Parallel Algorithms for Generating Random Permutations on a Shared memory Machine.
Richard J. Anderson
1990Parallel Construction of near Optimal binary Trees.
David G. Kirkpatrick, Teresa M. Przytycka
1990Parallel Least-Squares Solution of General and Toeplitz Systems.
Victor Y. Pan
1990Parallel Rectilinear Shortest Paths with Rectangular Obstacles.
Mikhail J. Atallah, Danny Z. Chen
1990Parallel Searching in Generalized Monge Arrays with Applications.
Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen
1990Preconditioning Index Set Transformations for Time-Optimal Affine Scheduling.
Björn Lisper
1990Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, Island of Crete, Greece, July 2-6, 1990
Frank Thomson Leighton
1990Processor Networks and Alternating Machines.
Jonathan F. Buss
1990Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications.
John H. Reif, Sandeep Sen
1990Routing Multiple Paths in Hypercubes.
David S. Greenberg, Sandeep N. Bhatt
1990Running Algorithms Efficiently on Faulty Hypercubes.
Jehoshua Bruck, Robert Cypher, Danny Soroker
1990Space-Efficient Representations of Shared Data for Parallel Computers.
Kieran T. Herley
1990Study of Parallelism in Regular Iterative Algorithms.
Vwani P. Roychowdhury, Thomas Kailath
1990The Chaos Router: A Practical Application of Randomization in Network Routing.
Smaragda Konstantinidou, Lawrence Snyder
1990The Expected Advantage of Asynchrony.
Richard Cole, Ofer Zajicek
1990Tight Bounds for Oblivious Routing in the Hypercube.
Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas
1990Utilizing Virtual Shared Memory in a Topology Independent, Multicomputer Environment.
Creve Maples
1990Wait-Free Data Structures in the Asynchronous PRAM Model.
James Aspnes, Maurice Herlihy