Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal  Home/Search
Context Related
Links: DBLP | dec.com/pub/DEC/SRC/res...SRC071.ps.gz 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: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Aleliunas et al. [1] posed the following question: "The reachability problem for undirected graphs can be solved in logspace and O.mn/ time [m is the number of edges and n is the number of vertices] by a probabilistic algorithm that simulates a random walk, or in linear time and space by a conventional deterministic graph traversal algorithm. Is there a spectrum of time-space trade-offs between these extremes?" We answer this question in the affirmative for graphs with a linear number of... (Update)
Context of citations to this paper: More
.... and have numerous applications in theoretical computer science, including space efficient algorithms for undirected connectivity [4, 8], derandomization [1] recycling of random bits [10, 15] approximation algorithms [6, 12, 17] efficient constructions in cryptography...
...n, requires time T = O(mn=S) In this paper we answer this question in the affirmative. 1. 1 Previous related work Broder et al. [BKRU] were the first to develop an algorithm that achieves a nontrivial tradeoff. Their algorithm is based on the following observation: the...
Cited by: More
Formal Rational Fractions and Random Walks on Cycle Graphs - Mosbah, Saheb (1996) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
Time-Space Tradeoffs for Graph s-t Connectivity - Barnes (1992) (Correct)
Active bibliography (related documents): More All
0.3: Descriptive and Computational Complexity - Immerman (1989) (Correct)
0.3: Nondeterministic Space is Closed Under Complementation - Immerman (1988) (Correct)
0.2: Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
Similar documents based on text: More All
0.2: Counting Minimum Weight Spanning Trees - Broder, Mayr (1995) (Correct)
0.1: On Balls and Bins with Deletions - Cole, Frieze, Maggs, Mitzenmacher.. (1998) (Correct)
0.1: Static and Dynamic Evaluation of QoS Properties - Pandurangan, Upfal (2000) (Correct)
Related documents from co-citation: More All
10: universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
9: The electrical resistance of a graph captures its commute and cover times - Chandra, Raghavan et al. - 1989
8: Lower bounds on the length of universal traversal sequences (context) - Borodin, Ruzzo et al. - 1992
BibTeX entry: (Update)
A. Z. Broder, A. R. Karlin, P. Raghavan, and E. Upfal. Trading space for time in undirected s-t connectivity. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 543--549, Seattle, WA, May 1989. http://citeseer.ist.psu.edu/broder91trading.html More
@inproceedings{ broder89trading,
author = "Andrei Z. Broder and Anna R. Karlin and Prabhakar Raghavan and Eli Upfal",
title = "Trading Space for Time in Undirected s-t Connectivity",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "543-549",
year = "1989",
url = "citeseer.ist.psu.edu/broder91trading.html" }
Citations (may not include all citations):148 Storing a sparse table with O (context) - Fredman, Komlos et al. - 1984
121 Denumerable Markov Chains (context) - Kemeny, Snell et al. - 1966
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
55 Parallel hashing: An efficient implementation of shared memo.. (context) - Karlin, Upfal - 1988 DBLP
43 Symmetric space-bounded computation (context) - Lewis, Papadimitriou - 1982 DBLP
27 Space lower bounds for maze threadability on restricted mach.. (context) - Cook, Rackoff - 1980 DBLP
10 Time-Space Tradeoffs for Undirected Graph Traversal - Beame, Borodin et al. - 1990 DBLP
9 A transmutation formula for markov chains (context) - Carne - 1985
3 Two applications of complementation via inductive counting (context) - Borodin, Cook et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (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