David Eppstein, Zvi Galil  Home/Search
Context Related
| uci.edu/~eppstein/...ppGalICALP89.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~eppstein/pubs/all (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper and supplied many helpful comments. This research was supported in part by NSF grants DCR-85-11713, CCR-86-05353, and CCR-88-14977, and by DARPA contract N00039-84-C-0165. (Update)
Context of citations to this paper: More
...our theoretical understanding of shared memory parallel algorithms and their complexity. PRAM A parallel random access machine (PRAM) [34, 97, 57] consists of a collection of processors that compute synchronously in parallel and that communicate with a common global random...
...wise operations are in the min plus semiring. In fact, this algorithm can compute shortest paths. The technique is well known; see [1, 7] for more details. The problem with this algorithm is that it requires too many processors; to achieve O(log n) time requires about n...
Cited by: More
Uniform Circuits and Exclusive Read PRAMs - Preliminary Version January (Correct)
Thinking in Parallel: Some Basic Data-Parallel Algorithms and.. - Vishkin (2002) (Correct)
Parallel Computing: Performance Metrics and Models - Sahni, Thanvantri (1995) (Correct)
Active bibliography (related documents): More All
0.8: Structural Parallel Algorithmics - Vishkin (1991) (Correct)
0.7: Using PRAM Algorithms on a Uniform-Memory-Access.. - Bader, Illendula, .. (2001) (Correct)
0.7: A New Parallel Algorithm for Planarity Testing - Bader, Sreshta (2003) (Correct)
Similar documents based on text: More All
0.2: Fully Dynamic Planarity Testing with Applications - Galil, Italiano, Sarnak (Correct)
0.2: Separator-Based Sparsification II: Edge And Vertex.. - Eppstein, Galil.. (1998) (Correct)
0.1: Efficient Algorithms for Sequence Analysis with Concave and.. - Eppstein (1989) (Correct)
Related documents from co-citation: More All
11: A Survey of Parallel Algorithms for Shared-Memory Machines (context) - Karp, Ramachandran - 1990
11: The parallel evaluation of general arithmetic expressions (context) - Brent - 1974
10: The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
BibTeX entry: (Update)
D. Eppstein and Z. Galil. Parallel algorithmic techniques for combinatorial computation. Ann. Rev. Comput. Sci., 3:233--283, 1988. http://citeseer.ist.psu.edu/eppstein88parallel.html More
@inproceedings{ eppstein89parallel,
author = "David Eppstein and Zvi Galil",
title = "Parallel Algorithmic Techniques for Combinatorial Computation",
booktitle = "Automata, Languages and Programming",
pages = "304-318",
year = "1989",
url = "citeseer.ist.psu.edu/eppstein88parallel.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
405 Depth-first Search and Linear Graph Algorithms (context) - Tarjan - 1972 DBLP
308 Matrix Multiplication via Arithmetic Progressions (context) - Coppersmith, Winograd - 1987
201 Parallel Prefix Computation (context) - Ladner, Fischer - 1980 ACM DBLP
200 Data Parallel Algorithms (context) - Hillis, Steele - 1986
199 A Simple Parallel Algorithm for the Maximal Independent Set .. (context) - Luby - 1985 ACM DBLP
196 How to Emulate Shared Memory (context) - Ranade - 1987 ACM DBLP
185 Applying Parallel Computation Algorithms in the Design of Se.. (context) - Megiddo - 1983 ACM DBLP
174 The Parallel Evaluation of General Arithmetic Expressions (context) - Brent - 1974 ACM DBLP
127 Principles of Compiler Design (context) - Aho, Ullman - 1977
122 Parallel Tree Contraction and its Application (context) - Miller, Reif - 1985
112 Randomized and Deterministic Simulations of PRAMs by Paralle.. (context) - Mehlhorn, Vishkin - 1984 ACM DBLP
106 Matching is as Easy as Matrix Inversion (context) - Mulmuley, Vazirani et al. - 1987 ACM DBLP
95 On Finding Lowest Common Ancestors: Simplification and Paral.. (context) - Schieber, Vishkin - 1987 ACM DBLP
79 Parallelism in Comparison Problems (context) - Valiant - 1975 DBLP
75 Deterministic Coin Tossing with Applications to Optimal Para.. (context) - Cole, Vishkin - 1986
66 Data Broadcasting SIMD Computers (context) - Nassimi, Sahni - 1981
63 Algorithm for Finding Maximum Matchings in General Graphs (context) - Micali, Vazirani - 1980
57 Deterministic Parallel List Ranking (context) - Anderson, Miller - 1988
56 Relations Between Concurrent-Write Models of Parallel Comput.. (context) - Fich, Ragde et al. - 1988 ACM DBLP
49 Approximate and Exact Parallel Scheduling with Applications .. (context) - Cole, Vishkin - 1986
47 Parallel Symmetry-Breaking in Sparse Graphs - Goldberg, Plotkin et al. - 1987
47 The Complexity of Parallel Computation (context) - Wyllie - 1979 ACM
41 Constructing a Perfect Matching is in Random NC (context) - Karp, Upfal et al. - 1985 ACM DBLP
41 Computing an st-numbering (context) - Even, Tarjan - 1976
40 Deterministic Coin Tossing and Accelerating Cascades: Micro .. (context) - Cole, Vishkin - 1986 ACM DBLP
38 Finding Biconnected Components and Computing Tree Functions .. (context) - Tarjan, Vishkin - 1984
34 A New Parallel Algorithm for the Maximal Independent Set Pro.. - Goldberg, Spencer - 1987
34 Non-Separable and Planar Graphs (context) - Whitney - 1932
33 A Simple Randomized Parallel Algorithm for List-Ranking (context) - Anderson, Miller ACM DBLP
33 The Power of Parallel Prefix (context) - Kruskal, Rudolph et al. - 1985
32 Optimal Tree Contraction in EREW Model (context) - Gazit, Miller et al.
30 Parallel Ear Decomposition Search (context) - Maon, Schieber et al. - 1986
28 An Optimal Randomized Parallel Algorithm for Finding Connect.. (context) - Gazit - 1986
26 An Improved Parallel Algorithm for Maximal Matching (context) - Israeli, Shiloach - 1986 ACM DBLP
23 A Random NC Algorithm for Depth First Search (context) - Aggarwal, Anderson - 1987 ACM DBLP
21 An Optimal Parallel Algorithm for Integer Sorting (context) - Reif - 1985 DBLP
18 Improved Algorithms for Graph Four-Connectivity (context) - Kanevsky, Ramachandran - 1987
18 Randomized Speed-ups in Parallel Computation (context) - Vishkin - 1984 ACM DBLP
17 Merging and Sorting in a Parallel Computation Model (context) - Shiloach, Vishkin et al. - 1981
17 A Parallel-Design Distributed-Implementation (context) - Vishkin - 1984
17 A New Graph Triconnectivity Algorithm and Its Parallelizatio.. (context) - Miller, Ramachandran - 1987 DBLP
16 New Simulations between CRCW PRAMs (context) - Chlebus, Diks et al.
14 A Fast and Simple Randomized Parallel Algorithm for Maximal .. (context) - Israeli, Itai - 1986 ACM DBLP
13 Parallel Computation and Conflicts in Memory Access (context) - Kucera - 1982 DBLP
12 ACM Trans (context) - Schwartz - 1980
12 Finding Euler Circuits in Logarithmic Parallel Time (context) - Awerbuch, Israeli et al. - 1984 ACM DBLP
12 Parallel Recognition and Decomposition of Two Terminal Serie.. (context) - He, Yesha - 1987
12 Parallel Recognition of Series-Parallel Graphs - Eppstein ACM DBLP
11 Optimal Parallel Algorithms for Expression Tree Evaluation a.. (context) - Cole, Vishkin - 1988 ACM DBLP
11 Simulations Among Concurrent-Write PRAMs (context) - Fich, Ragde et al. - 1988
10 Finding Euler Tours in Parallel (context) - Atallah, Vishkin - 1984
10 Probabilistic Parallel Prefix Computation - Reif
10 Parallel Algorithms for the Transitive Closure and the Conne.. (context) - Hirschberg - 1976
9 Design and Analysis of some Parallel Algorithms (context) - Schieber - 1987
7 Computing Ears and Branchings in Parallel (context) - Lovasz - 1985 ACM DBLP
5 Asymptotic Estimation of Addition Time of a Parallel Adder (context) - Krapchenko - 1970
4 Theory of Computing (context) - Ajtai, Komlos et al. - 1983
4 Are Search and Decision Problems Computationally Equivalent (context) - Karp, Upfal et al. - 1985
4 cient Parallel Algorithm for Planarity (context) - Klein, Reif - 1986
3 cient Implementation of Shared Memory (context) - Karlin, Upfal et al. - 1986
3 Improved Processor Bounds for Algebraic and Combinatorial Pr.. (context) - Galil, Pan - 1985 DBLP
2 cient Parallel Ear Decomposition with Applications (context) - Miller, Ramachandran
1 Parallel Algebraic Computations (context) - Gathen - 1984
1 Sequential and Parallel Algorithms for Finding Maximum Match.. (context) - Galil - 1986 ACM
1 cient Parallel Strong Orientation (context) - Vishkin - 1985
1 cient Simulations between Concurrent-Read Concurrent-Write P.. (context) - Chlebus, Diks et al. - 1988
1 cient Parallel Triconnectivity in Logarithmic Time (context) - Ramachandran, Vishkin - 1988
1 A Direct Approach to the Parallel Evaluation of Rational Exp.. (context) - Snir, Barak - 1977 DBLP
1 Implementation of Simulations Memory Access Models that Forb.. (context) - Vishkin - 1983
1 A Geometric Interpretation of Graph Connectivity and its Alg.. (context) - Linial, Lovasz et al. - 1986
1 An Optimal Parallel Processor Bound Strong Orientation of an.. (context) - Tsin - 1985
1 Incomparibility in Parallel Computation (context) - Grolmusz, Ragde - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/all.html): More
Linear Complexity Hexahedral Mesh Generation - Eppstein (1996) (Correct)
Ununfoldable Polyhedra - Bern, Demaine, Eppstein, Kuo (1999) (Correct)
Parametric and Kinetic Minimum Spanning Trees - Agarwal, Eppstein, Guibas.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC