Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta  Home/Search
Context
Related
| gatech.edu/~parik/RESEARCH/stcon.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: gatech.edu/~parik/ (more) Homepages: P.Gopalan |
Rate this article:      (best)Comment on this article |
Abstract: We present a spectrum of randomized time-space tradeoffs for solving directed graph connectivity or STCONN in small space. We use a strategy parameterized by a parameter k that uses k pebbles and performs short random walks of length n^(1/k) using a probabilistic counter. We use this to get a family... (Update)
Active bibliography (related documents): More All
0.4: Time-Space Lower Bounds for Directed s-t Connectivity on JAG.. - Barnes, Edmonds (1993) (Correct)
0.3: The Complexity of Planarity Testing - Allender, Mahajan (2003) (Correct)
0.3: On the Complexity of the st-Connectivity Problem - Poon (1996) (Correct)
Similar documents based on text: More All
0.3: Keeping Track of the Latest Gossip in Shared Memory Systems - Adsul, Mehta, Sohoni (Correct)
0.2: Caching with Expiration Times - Parikshit Gopalan Howard (Correct)
0.2: Playing Large Games using Simple Strategies - Lipton, Markakis, Mehta (2003) (Correct)
BibTeX entry: (Update)
@misc{ gopalan-randomized,
author = "Parikshit Gopalan and Richard J. Lipton and Aranyak Mehta",
title = "Randomized Time-Space Tradeoffs for Directed Graph Connectivity",
url = "citeseer.ist.psu.edu/679379.html" }
Citations (may not include all citations):145 Computational complexity of probabilistic turing machines (context) - Gill - 1974
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
31 Undirected connectivity in O (context) - Nisan, Szemeredi et al. - 1989
27 Space lower bounds for maze threadability on restricted mach.. (context) - Cook, Racko - 1980
15 Randomization and derandomization in space-bounded computati.. - Saks - 1996
12 polynomial time algorithm for directed s-t connectivity (context) - Barnes, Buss et al. - 1992
10 Lower bounds on graph threading by probabilistic machines (context) - Berman, Simon - 1983
9 The complexity of graph connectivity (context) - Wigderson - 1992
7 Space bounds for graph connectivity problems on node named j.. (context) - Poon - 1993
6 Space-bounded probabilistic turing machine complexity classe.. (context) - Simon - 1981
6 connectivity in undirected graphs (context) - Armoni, Ta-Shma et al. - 2000
5 Journal of Computational Complexity (context) - Nisan, SC - 1994
1 connectivity problem (context) - Poon, complexity et al. - 1996
1 Personal communication (context) - Poon
1 Tight lower bounds for st-connectivity on the NNJAG model - Edmonds, Poon et al. - 1999
1 A spectrum of time-space tradeo s for undirected s-t connect.. (context) - Feige - 1997
Documents on the same site (http://www.cc.gatech.edu/~parik/): More
The Degree of Threshold mod 6 and Diophantine Equations - Bhatnagar, Gopalan, Lipton (Correct)
Polynomials that Sign Represent Parity and Descartes.. - Basu, Bhatnagar.. (2004) (Correct)
Symmetric Polynomials over Z_m and Simultaneous.. - Bhatnagar, Gopalan.. (2003) (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