Greg Barnes, Jeff A. Edmonds  Home/Search
Context Related
| cs.yorku.ca/~jeff/res...barns_focs.ps.Z tiger.cs.yorku.ca/~je...barns_focs.ps.Z 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: cs.yorku.ca/~jeff/researc...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Greg Barnes Jeff A. Edmonds y Abstract Directed s-t connectivity is the problem of detecting whether there is a path from a distinguished vertex s to a distinguished vertex t in a directed graph. We prove time-space lower bounds of ST = \Omega\Gamma n 2 = log n) and S 1=2 T = \Omega\Gamma mn 1=2 ) for Cook and Rackoff's JAG model [8], where n is the number of vertices and m the number of edges in the input graph, and S is the space and T the time used by the JAG. We also prove a... (Update)
Context of citations to this paper: More
.... deterministic linear time) Time space lower bounds have also been shown for other models such as Jumping Automata for Graphs (JAG) [6, 1, 5], branching programs [12, 3, 2] and comparison models [16] 2 Preliminaries We will use the multi tape Turing machine model to prove the...
.... A related problem for which lower bounds have been studied extensively, is the s t connectivity problem in directed graphs, see [3, 4, 14] and references therein. Given a directed graph, the problem is to decide whether there exists a path from a distinguished node s to a...
Cited by: More
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
On the Complexity of SAT - Lipton, Viglas (1999) (Correct)
On the Complexity of the st-Connectivity Problem - Poon (1996) (Correct)
Similar documents (at the sentence level):
27.9%: Time-Space Lower Bounds for Undirected and Directed.. - Edmonds (1993) (Correct)
18.4%: Time-Space Lower Bounds For Directed st-Connectivity On Graph .. - Barnes, Edmonds (1998) (Correct)
Active bibliography (related documents): More All
1.0: Tight Lower Bounds for st-Connectivity on the NNJAG Model - Edmonds, Poon, Achlioptas (1999) (Correct)
0.7: Time-Space Trade-Offs For Undirected ST-Connectivity on a JAG - On (Correct)
0.6: Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
Similar documents based on text: More All
0.4: Tight Lower Bounds For st-Connectivity On The NNJAG Model - Edmonds, Poon, al. (1999) (Correct)
0.3: Reachability and the Power of Local Ordering - Etessami, Immermann (1994) (Correct)
0.3: Dilemma - A Tool To Ensure Quality Of New.. - Karlgren.. (1994) (Correct)
Related documents from co-citation: More All
8: Time-space trade-offs for undirected st-connectivity on a JAG (context) - Edmonds - 1993
8: polynomial time algorithm for directed s-t connectivity (context) - Barnes, Buss et al. - 1992
8: Space lower bounds for maze threadability on restricted machines (context) - Cook, Rackoff - 1980
BibTeX entry: (Update)
Greg Barnes, Jeff Edmonds. Time-Space Lower Bounds for Directed s-t Connectivity on JAG Models To appear in 34st Annual Symposium on Foundations of Computer Science, Palo Alto, CA, Nov. 1993. http://citeseer.ist.psu.edu/article/barnes93timespace.html More
@article{ barnes98timespace,
author = "Greg Barnes and Jeff Edmonds",
title = "Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models",
journal = "SIAM J. Comput.",
volume = "27",
number = "4",
pages = "1190-1202",
year = "1998",
url = "citeseer.ist.psu.edu/article/barnes93timespace.html" }
Citations (may not include all citations):170 Nondeterministic space is closed under complementation - Immerman - 1988
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970
43 Symmetric space-bounded computation (context) - Lewis, Papadimitriou - 1982
29 The method of forcing for nondeterministic automata (context) - Szelepcs'enyi - 1988
29 A time-space tradeoff for sorting on a general sequential mo.. (context) - Borodin, Cook - 1982
27 Space lower bounds for maze threadability on restricted mach.. (context) - Cook, Rackoff - 1980
19 A time-space tradeoff for sorting on non-oblivious machines - Borodin, Fischer et al. - 1981
14 Lower bounds on the length of universal traversal sequences (context) - Borodin, Ruzzo et al. - 1992
12 polynomial time algorithm for directed s-t connectivity (context) - Barnes, Buss et al. - 1992
12 Two familiar transitive closure algorithms which admit no po.. (context) - Tompa - 1982
11 Time-space trade-offs for undirected ST -connectivity on a J.. (context) - Edmonds - 1993
10 Lower bounds on graph threading by probabilistic machines (context) - Berman, Simon - 1983
9 general models in computational complexity (context) - Borodin - 1982
9 The complexity of graph connectivity (context) - Wigderson - 1992
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
1 polynomial time algorithm for directed st-connectivity on th.. (context) - Poon, space - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.yorku.ca/~jeff/research/index.html): More
Communication Complexity Towards Lower Bounds on.. - Edmonds, Rudich.. (1991) (Correct)
Removing Ramsey Theory: Lower Bounds With Smaller Domain Size - Edmonds (Correct)
Scheduling in the Dark - Edmonds (1999) (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