Jeff A. Edmonds  Home/Search
Context Related
| cs.yorku.ca/~jeff/researc...thesis.ps.Z tiger.cs.yorku.ca/~jeff/r...thesis.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: Time-space lower bounds for undirected and directed st-connectivity on JAG models Jeff A. Edmonds Doctor of Philosophy 1993 Department of Computer Science University of Toronto Directed and undirected st-connectivity are important problems in computing. There are algorithms for the undirected case that use O (n) time and algorithms that use O (log n) space. The first result of this thesis proves that, in a very natural structured model, the JAG (Jumping Automata for Graphs), these upper... (Update)
Context of citations to this paper: More
.... = log n) on the JAG model by Barnes and Edmonds [BE93] and that of S 1=3 T 2 Omega Gamma n 4=3 ) on the NNJAG model by Edmonds [Edm93a] Our lower bound is tight for S 2 O(n 1 Gammaffi ) for any ffi 0, matching the upper bound of Barnes et al. BBRS92] As a corollary of...
.... st connectivity result using recursive flyswatters as given in my thesis and in STOC 93 [Ed93a, Ed PHD]. The input graph and the reduction techniques in the two proofs are similar. The main difference is that JAG result is reduced to a different game. In this paper, the...
Cited by: More
On the Complexity of the st-Connectivity Problem - Poon (1996) (Correct)
Time-Space Lower Bounds For Directed st-Connectivity On Graph .. - Barnes, Edmonds (1998) (Correct)
Tight Lower Bounds For st-Connectivity On The NNJAG Model - Edmonds, Poon, al. (1999) (Correct)
Similar documents (at the sentence level):
6.5%: Time-Space Lower Bounds for Directed s-t Connectivity on JAG.. - Barnes, Edmonds (1993) (Correct)
6.5%: Time-Space Trade-Offs For Undirected ST-Connectivity on a JAG - On (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 Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
0.7: A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
Similar documents based on text: More All
0.3: Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (2003) (Correct)
0.2: Space-Optimal Multi-Writer Snapshot Objects Are Slow - Fatourou, Fich, Ruppert (2002) (Correct)
0.2: Reachability and the Power of Local Ordering - Etessami, Immerman (1994) (Correct)
Related documents from co-citation: More All
6: Space lower bounds for maze threadability on restricted machines (context) - Cook, Rackoff - 1980
5: Two familiar transitive closure algorithms which admit no polynomial time (context) - Tompa - 1982
5: Relationships between nondeterministic and deterministic tape complexities (context) - Savitch - 1970
BibTeX entry: (Update)
J. A. Edmonds. Time-Space Lower Bounds for Undirected and Directed ST-Connectivity on JAG Models. PhD thesis, University of Toronto, Aug. 1993. http://citeseer.ist.psu.edu/21032.html More
@misc{ edmonds93timespace,
author = "J. Edmonds",
title = "Time-Space Lower Bounds for Undirected and Directed ST-Connectivity on
JAG Models",
text = "J. A. Edmonds. Time-Space Lower Bounds for Undirected and Directed ST-Connectivity
on JAG Models. PhD thesis, University of Toronto, Aug. 1993.",
year = "1993",
url = "citeseer.ist.psu.edu/21032.html" }
Citations (may not include all citations):70 Two theorems on random polynomial time (context) - Adleman - 1978
68 The electrical resistance of a graph captures its commute an.. - Chandra, Raghavan et al. - 1989
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
39 pseudorandom generators for logspace (context) - Babai, Nisan et al. - 1992
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
21 The recognition problem for the set of perfect squares (context) - Cobham - 1966
21 Short random walks on graphs - Barnes, Feige - 1993
19 A time-space tradeoff for sorting on non-oblivious machines - Borodin, Fischer et al. - 1981
14 A timespace tradeoff for element distinctness (context) - Borodin, Fich et al. - 1987
14 Lower bounds on the length of universal traversal sequences (context) - Borodin, Ruzzo et al. - 1992
14 Trading space for time in undirected s-t connectivity - Broder, Karlin et al. - 1989
12 polynomial time algorithm for directed s-t connectivity (context) - Barnes, Buss et al. - 1992
11 Time-space trade-offs for undirected st-connectivity on a JA.. (context) - Edmonds - 1993
11 Time-Space Lower Bounds for Directed s-t Connectivity on JAG.. - Barnes, Edmonds - 1993
10 Lower bounds on graph threading by probabilistic machines (context) - Berman, Simon - 1983
9 general models in computational complexity (context) - Borodin - 1982
7 A general time-space tradeoff for finding unique elements (context) - Beame - 1991
7 Time-space tradeoffs for undirected graph connectivity (context) - Beame, Borodin et al. - 1990
3 Time-space tradeoffs for branching programs contrasted with .. (context) - Abrahamson - 1986
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