Pradyut Shah  Home/Search
Context
Related
Links: ACM | uchicago.edu/~pradyut/pape...thesis.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: uchicago.edu/~pradyut/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: xvii 1 (Update)
Similar documents (at the sentence level):
8.0%: A Lower Bound for the Shortest Path Problem - Mulmuley (Correct)
Active bibliography (related documents): More All
2.7: A Lower Bound on Computing Blocking Flows in Graphs - Mulmuley (Correct)
0.5: Lower Bounds In A Parallel Model Without Bit Operations - Mulmuley (1999) (Correct)
0.5: The Maximum Flow Problem: A Real-Time Approach - Nagy, Akl (2001) (Correct)
Similar documents based on text: More All
0.5: Kolmogorov Techniques in Computational Complexity Theory - Laplante (1997) (Correct)
0.3: Induced Graph Ramsey Theory - Schaefer, Shah (2000) (Correct)
0.3: Interactive Proof Systems - Radhakrishnan, Saluja (Correct)
BibTeX entry: (Update)
@misc{ shah-lower,
author = "Pradyut Shah",
title = "Lower Bounds For Parallel Algorithms",
url = "citeseer.ist.psu.edu/shah01lower.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1992 ACM
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
356 Computers and Intractability : A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
354 A note on two problems in connexion with graphs (context) - Dijkstra - 1959
206 Rinehart and Winston (context) - Lawler, Networks et al. - 1991
162 A new approach to the maximum flow problem (context) - Goldberg, Tarjan - 1986 ACM DBLP
141 Synthesis of Parallel Algorithms (context) - Reif - 1993 ACM
134 Geometric Algorithms and Combinatorial Optimization (context) - otschel, aszl et al. - 1988
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970 DBLP
124 Lower bounds for algebraic computation trees (context) - Ben-Or - 1983 ACM
106 Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987 ACM DBLP
97 Limits to Parallel Computation : P-Completeness Theory - Greenlaw, Hoover et al. - 1995
86 A theorem on Boolean matrices (context) - Warshall - 1962 ACM DBLP
84 Mathematical Systems Theory (context) - Furst, Saxe et al. - 1984 ACM
84 The Design and Analysis of Algorithms (context) - Kozen - 1992 ACM
83 The monotone circuit complexity of boolean functions (context) - Alon, Boppana - 1987 ACM DBLP
83 Princeton Univ (context) - Ford, Fulkerson et al. - 1973
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
59 Communications of the ACM (context) - Floyd, SHORTEST - 1962
47 Fast parallel matrix inversion algorithms (context) - Csanky - 1976 DBLP
44 Algorithm for solution of a problem of maximum flow in netwo.. (context) - Dinic - 1970
34 The gap between monotone and non-monotone circuit complexity.. (context) - Tardos - 1988 DBLP
33 Canadian Journal of Mathematics (context) - Edmonds, trees - 1965
27 parallel MAX-FLOW algorithm (context) - Shiloach, Vishkin et al. - 1982
15 Almost optimal lower bounds for small depth circuits - astad - 1986 ACM DBLP
13 An application of simultaneous Diophantine approximation in .. (context) - Frank, Tardos - 1987 ACM DBLP
12 A fast parallel algorithm for determining all roots of a pol.. (context) - Ben-Or, Feig et al. - 1986 ACM DBLP
11 the max-flow min-cut theorem of networks (context) - Dantzig, Fulkerson - 1956
8 A parallel blocking flow algorithm for acyclic networks (context) - Vishkin - 1992 ACM DBLP
8 algorithm for finding maximum flows in networks (context) - Malhotra, Kumar et al. - 1978
6 Lower bounds on the complexity of some boolean functions (context) - Razborov - 1985
6 volume 29 of Annals of Discrete Mathematics (context) - aszl, asz et al. - 1986
5 cient algorithms for shortest paths in sparse networks (context) - Johnson - 1977
5 Theoretical improvements in the algorithmic e#ciency for net.. (context) - Edmonds, Karp - 1972
5 The complexity of minimum cut and maximum flow problems in a.. (context) - Ramachandran - 1987 ACM
5 Lower bounds in a parallel model without bit operations - Mulmuley - 1999 ACM DBLP
4 volume 44 of CBMS-NSF Reg (context) - Tarjan, network - 1983
4 Complexity of some parametric integer and network programmin.. (context) - Carstensen - 1983
4 Lower bounds for algebraic computation trees with integer in.. (context) - Yao - 1977 ACM DBLP
4 Separating the polynomial-time hierarchy by oracles (context) - Yao - 1985 ACM
4 The Complexity of Some Problems in Parametric Linear and Com.. (context) - Carstensen - 1983 ACM
4 An NC algorithm for minimum cuts - Karger, Motwani - 1997 DBLP
4 algorithm for maximum network flow (context) - Sleator, Tarjan et al. - 1980
4 Specified precision polynomial root isolation is in NC (context) - Ne - 1994 ACM DBLP
3 Lower bounds on algebraic random access machines (context) - Ben-Amram, Galil - 1995
3 A parallel algorithm for finding a blocking flow in an acycl.. (context) - Goldberg, Tarjan - 1989 ACM DBLP
2 Parametric cost shortest chain problem (context) - Carstensen - 1987
1 Determining the maximal flow through a network by the method.. (context) - Karzanov - 1974
1 Topological lower bounds on algebraic random access machines (context) - Ben-Amram, Galil ACM DBLP
Documents on the same site (http://people.cs.uchicago.edu/~pradyut/):
A Lower Bound on Computing Blocking Flows in Graphs - Mulmuley (Correct)
A Lower Bound for the Shortest Path Problem - Mulmuley (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