Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa  Home/Search
Context Related
Links: DBLP | washington.edu/tr/...CSE930201.PS.Z washington.edu/homes/beame/pap...bag.ps 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: washington.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove time-space tradeoffs for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Rackoff 's "Jumping Automata for Graphs". Our strongest tradeoff is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depth-first search is optimal. Since our bound in fact applies to nondeterministic algorithms for nonconnectivity, it also implies that closure... (Update)
Context of citations to this paper: More
...on which lower bounds are proved are known as JAG models ( Jumping Automata on Graphs ) and there are several versions of these models. In [BBRRT], a lower bound of Omega Gamma n 2 ) is proved for a model that allows for an initial phase of distributing landmarks, but requires...
...4. Open Problem The obvious important problem is to strengthen and generalize these lower bounds. Following an earlier version of this paper [9], Edmonds [21] proved a much stronger time space tradeoff on general JAGs: for every z 2, a JAG with at most 28z log n log log n...
Cited by: More
Traversal of a Quasi-Planar Subdivision without.. - Chavez, Dobrev.. (2004) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
A Spectrum of Time-Space Tradeoffs for Undirected s-t Connectivity - Feige (1996) (Correct)
Similar documents (at the sentence level):
48.9%: Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
Active bibliography (related documents): More All
2.0: Time-Space Tradeoffs for Graph s-t Connectivity - Barnes (1992) (Correct)
1.7: Deterministic Algorithms for Undirected s-t Connectivity Using .. - Barnes, Ruzzo (1991) (Correct)
0.5: Time-Space Trade-Offs For Undirected ST-Connectivity on a JAG - On (Correct)
Similar documents based on text: More All
0.5: Lower Bounds on Universal Traversal Sequences Based on Chains of.. - Buss (1995) (Correct)
0.5: Lower Bounds On Universal Traversal Sequences For Cycles And.. - Martin Tom Pa (Correct)
0.4: Lecture Notes on Message Routing in Parallel Machines - Martin Tompa (1994) (Correct)
Related documents from co-citation: More All
8: Space lower bounds for maze threadability on restricted machines (context) - Cook, Rackoff - 1980
6: universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
6: Time-space trade-offs for undirected st-connectivity on a JAG (context) - Edmonds - 1993
BibTeX entry: (Update)
Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter Ruzzo, and Martin Tompa. Time-space tradeoffs for undirected graph traversal. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 429--430, 1990. http://citeseer.ist.psu.edu/article/beame93timespace.html More
@inproceedings{ beame90timespace,
author = "Paul Beame and Allan Borodin and Prabhakar Raghavan and Walter L. Ruzzo and Martin Tompa",
title = "Time-Space Tradeoffs for Undirected Graph Traversal",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "429-438",
year = "1990",
url = "citeseer.ist.psu.edu/article/beame93timespace.html" }
Citations (may not include all citations):170 Nondeterministic space is closed under complementation - Immerman - 1988 ACM DBLP
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970 DBLP
70 Two theorems on random polynomial time (context) - Adleman - 1978 DBLP
68 The electrical resistance of a graph captures its commute an.. - Chandra, Raghavan et al. - 1989 ACM DBLP
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
53 Topics in Algebra (context) - Herstein - 1975
48 Two applications of inductive counting for complementation p.. (context) - Borodin, Cook et al. - 1989 ACM DBLP
40 On representatives of subsets (context) - Hall - 1935
31 Undirected connectivity in O (context) - Nisan, Szemer'edi et al. - 1992
29 The method of forcing for nondeterministic automata (context) - Szelepcs'enyi - 1988
27 Space lower bounds for maze threadability on restricted mach.. (context) - Cook, Rackoff - 1980 DBLP
25 why mazes are easier to search than graphs (context) - Blum, Kozen et al. - 1978
21 The recognition problem for the set of perfect squares (context) - Cobham - 1966 DBLP
20 the cover time of random walks on graphs (context) - Kahn, Linial et al. - 1989
15 Maze recognizing automata and nondeterministic tape complexi.. (context) - Savitch - 1973 DBLP
14 Trading space for time in undirected s-t connectivity - Broder, Karlin et al. - 1989 DBLP
14 Lower bounds on the length of universal traversal sequences (context) - Borodin, Ruzzo et al. - 1992 ACM DBLP
14 the capability of finite automata in 2 and 3 dimensional spa.. (context) - Blum, Sakoda - 1977
12 Two familiar transitive closure algorithms which admit no po.. (context) - Tompa - 1982
12 polynomial time algorithm for directed s-t connectivity (context) - Barnes, Buss et al. - 1992
11 Universal sequences for complete graphs (context) - Alon, Azar et al. - 1990 ACM
10 Extremal Graph Theory with Emphasis on Probabilistic Methods (context) - Bollob'as - 1986
10 Lower bounds on graph threading by probabilistic machines (context) - Berman, Simon - 1983
9 general models in computational complexity (context) - Borodin - 1982
9 Universal traversal sequences for paths and cycles (context) - Bridgland - 1987 ACM DBLP
9 Lower bounds on universal traversal sequences for cycles and.. (context) - Tompa - 1992
8 Deterministic algorithms for undirected s-t connectivity usi.. - Barnes, Ruzzo - 1991
7 Bounds on universal sequences (context) - Bar-Noy, Borodin et al. - 1989 ACM DBLP
7 Polynomial universal traversing sequences for cycles are con.. (context) - Istrail - 1988 ACM
6 Universal traversal sequences of length n O (context) - Karloff, Paturi et al. - 1988
6 Labyrinth Problems: Labyrinth-Searching Abilities of Automat.. (context) - Hemmerling - 1989
4 Constructing generalized universal traversing sequences of p.. (context) - Istrail - 1990
3 Universal sequences for expander graphs (context) - Hoory, Wigderson - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.washington.edu.html): More
Mobisaic - Voelker, Bershad (1995) (Correct)
Automatic SAT-Compilation of Planning Problems - Ernst, Millstein, Weld (1997) (Correct)
Monitoring Timing Constraints in Distributed Real-time.. - Raju, Rajkumar, Jahanian (1992) (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