N. Nisan, E. Szemeredi, and A. Wigderson. Undirected connectivity in O((log n)) space. In Proceedings of the 33th IEEE Symposium on Foundations of Computer Science, pages 24--29. Institute of Electrical and Electronics Engineers, 1992. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
A Short History of Computational Complexity - Fortnow, Homer (2002) (Correct)
Randomization and Derandomization in Space-Bounded Computation - Saks (1996) (14 citations) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Symmetric Logspace is Closed Under Complement - Nissin, al. (1994) (Correct)
Algorithmic Derandomization via Complexity Theory - Sivakumar (2002) (2 citations) (Correct)
Reducing Randomness In Computation Via Explicit Constructions - Zhou (1996) (Correct)
An Optimal Randomized Logarithmic Time Connectivity Algorithm .. - Halperin, Zwick (1996) (12 citations) (Correct)
Time-Space Tradeoffs for Graph s-t Connectivity - Barnes (1992) (Correct)
Short Random Walks On Graphs - Barnes, Feige (1993) (19 citations) (Correct)
An Unambiguous Class Possessing a Complete Set - Lange (1996) (4 citations) (Correct)
Model Checking by Random Walk - Haslum (1999) (1 citation) (Correct)
A Sublinear Space, Polynomial Time Algorithm for Directed - Connectivity Greg Barnes (Correct)
The Complexity of Planarity Testing - Allender, Mahajan (2000) (1 citation) (Correct)
Graded Self-Reducibility - Ogihara, Regan, Toda (1998) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Improved Algorithms via Approximations of Probability.. - Chari, Rohatgi.. (1997) (11 citations) (Correct)
A Sublinear Space, Polynomial Time Algorithm for Directed - Connectivity Greg (1992) (Correct)
The Complexity of Reconfiguring Network Models - Ben-Asher, Lange, Peleg.. (1992) (3 citations) (Correct)
Randomized Time-Space Tradeoffs for Directed Graph.. - Gopalan, Lipton, Mehta (Correct)
Optimal randomized EREW PRAM algorithms for finding spanning.. - Halperin, Zwick (2000) (9 citations) (Correct)
The Complexity of Planarity Testing - Allender, Mahajan (2003) (1 citation) (Correct)
Symmetric Logspace is Closed under Complement - Nisan, al. (1995) (24 citations) Self-citation (Nisan) (Correct)
Derandomization That is Rarely Wrong From Short Advice.. - Goldreich, Wigderson (2002) Self-citation (Wigderson) (Correct)
Symmetric Logspace is Closed Under Complement - Nisan, Ta-Shma (1995) (24 citations) Self-citation (Nisan) (Correct)
Symmetric Logspace is Closed Under Complement - Nisan (1995) (24 citations) Self-citation (Nisan) (Correct)
First 50 documents
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