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