Jeff Edmonds, Chung Keung Poon, et al.  Home/Search
Context Related
| siam.org/sambin/getfile/S...29594.ps.Z microsoft.com/users/optas/pa...nnjag.ps microsoft.com/~optas/papers/nnjag.ps From: siam.org/sambin/dbq/arti...29594 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Directed st-connectivity is the problem of deciding whether or not there exists a path from a distinguished node s to a distinguished node t in a directed graph. We prove a time-space lower bound on the probabilistic NNJAG model of Poon [Proc. 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 1993, pp. 218-227]. Let n be the number of nodes in the input graph and S and T be the space and time used by the NNJAG, respectively. We show that, for any # > 0, if an NNJAG uses... (Update)
Cited by: More
Randomized Time-Space Tradeoffs for Directed Graph.. - Gopalan, Lipton, Mehta (Correct)
Similar documents (at the sentence level):
37.4%: Tight Lower Bounds for st-Connectivity on the NNJAG Model - Edmonds, Poon, Achlioptas (1999) (Correct)
11.0%: On the Complexity of the st-Connectivity Problem - Poon (1996) (Correct)
Active bibliography (related documents): More All
4.7: Time-Space Lower Bounds For Directed st-Connectivity On Graph .. - Barnes, Edmonds (1998) (Correct)
0.4: Time-Space Lower Bounds for Directed s-t Connectivity on JAG.. - Barnes, Edmonds (1993) (Correct)
0.3: The PL Hierarchy Collapses - Ogihara (1998) (Correct)
Similar documents based on text: More All
0.2: Time-Space Lower Bounds for Undirected and Directed.. - Edmonds (1993) (Correct)
0.2: Emergent Behaviour In Co-Evolutionary Design - Poon, MAHER (1996) (Correct)
0.2: On the Competitiveness of TCP within a General Network - Edmonds (2001) (Correct)
BibTeX entry: (Update)
J. Edmonds, C. Poon, and D. Achlioptas. Tight lower bounds for st-connectivity on the NNJAG model. SIAM J. Comput., 28(6):2257-2284, 1999. http://citeseer.ist.psu.edu/edmonds99tight.html More
@article{ edmonds99tight,
author = "Jeff Edmonds and Chung Keung Poon and Dimitris Achlioptas",
title = "Tight Lower Bounds for st-Connectivity on the {NNJAG} Model",
journal = "{SIAM} J. Comput.",
volume = "28",
number = "6",
pages = "2257--2284",
year = "1999",
url = "citeseer.ist.psu.edu/edmonds99tight.html" }
Citations (may not include all citations):152 Probabilistic computations: Toward a unified measure of (context) - Yao - 1977
145 Computational complexity of probabilistic Turing<F (context) - Gill - 1977
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
27 Space lower bounds for maze threadability on restricted<F (context) - Cook, Rackoff - 1980
19 Springer-Verlag (context) - Athreya, Ney et al. - 1972
12 Two familiar transitive closure algorithms which admit no po.. (context) - Tompa - 1982
11 A nearly optimal time-space lower bound for directed<F (context) - Edmonds, Poon - 1995
7 Space bounds for graph connectivity problems on node-named J.. (context) - Poon - 1993
6 Time-Space Lower Bounds for Undirected and Directed ST-Conne.. - Edmonds - 1993
4 A time-space tradeo# for sorting on a general sequential mod.. (context) - Borodin, Cook - 1982
3 Nondeterministic space is closed under<F (context) - Immerman - 1988
2 Time-space trade-o#s for undirected<F (context) - Edmonds - 1993
2 Time-space lower bounds for directed<F (context) - Barnes, Edmonds - 1993
2 Lower bounds on the length of universal traversal<F (context) - Borodin, Ruzzo et al. - 1992
2 general models in computational<F (context) - Borodin, Structured - 1982
2 Symmetric space-bounded<F (context) - Lewis, Papadimitriou - 1982
2 Lower bounds on graph threading by probabilistic<F (context) - Berman, Simon - 1983
2 The method of forcing for nondeterministic<F (context) - Szelepcs, enyi - 1988
2 The complexity of graph<F (context) - Wigderson - 1992
1 A time-space tradeo# for sorting on non-oblivious<F (context) - Borodin, Fischer et al. - 1981
1 A general sequential time-space tradeo# for finding unique<F (context) - Beame - 1991
1 Time-space tradeo#s for undirected graph<F (context) - Beame, Borodin et al. - 1998
1 Reachability and the power of local<F (context) - Etessami, Immerman - 1994
1 the Complexity of the ST-Connectivity<F (context) - Poon, On - 1996
1 Undirected connectivity in<F (context) - Nisan, edi et al. - 1992
1 A time-space tradeo# for element<F (context) - Borodin, Fich et al. - 1987
1 polynomial time algorithm for directed<F (context) - Barnes, Buss et al. - 1992
1 Near-optimal time-space tradeo# for element<F (context) - Yao - 1988
1 A catalog of complexity<F (context) - Johnson - 1990
1 The asymptotic optimality of spider-web<F (context) - Pippenger - 1992
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