J. A. Edmonds. Time-space trade-offs for undirected ST -connectivity on a JAG. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pages 718--727, San Diego, CA, May 1993. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
On the Complexity of SAT - Lipton, Viglas (1999) (11 citations) (Correct)
A Spectrum of Time-Space Tradeoffs for Undirected s-t Connectivity - Feige (1996) (Correct)
On the Complexity of SAT - Lipton, Viglas (1999) (11 citations) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Improved Depth Lower Bounds for Small Distance Connectivity - Beame, Impagliazzo, al. (1995) (1 citation) (Correct)
The Power of Team Exploration: Two Robots Can Learn Unlabeled .. - Bender, Slonim (1994) (25 citations) (Correct)
Time-Space Trade-Offs For Undirected ST-Connectivity on a JAG - On (Correct)
Tight Lower Bounds for st-Connectivity on the NNJAG Model - Edmonds, Poon, Achlioptas (1999) (1 citation) Self-citation (Edmonds) (Correct)
Time-Space Lower Bounds for Undirected and Directed.. - Edmonds (1993) (2 citations) Self-citation (Edmonds) (Correct)
Time-Space Lower Bounds for Directed s-t Connectivity on JAG.. - Barnes, Edmonds (1993) (9 citations) Self-citation (Edmonds) (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