| 1998 |
|---|
| 9 | EE | Greg Barnes,
Jeff Edmonds:
Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models.
SIAM J. Comput. 27(4): 1190-1202 (1998) |
| 8 | EE | Greg Barnes,
Jonathan F. Buss,
Walter L. Ruzzo,
Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity.
SIAM J. Comput. 27(5): 1273-1282 (1998) |
| 1997 |
|---|
| 7 | | Greg Barnes,
Walter L. Ruzzo:
Undirected s-t Connectivity in Polynomial Time and Sublinear Space.
Computational Complexity 6(1): 1-28 (1997) |
| 1996 |
|---|
| 6 | EE | Greg Barnes,
Uriel Feige:
Short Random Walks on Graphs.
SIAM J. Discrete Math. 9(1): 19-28 (1996) |
| 1993 |
|---|
| 5 | | Greg Barnes,
Jeff Edmonds:
Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract)
FOCS 1993: 228-237 |
| 4 | EE | Greg Barnes:
A Method for Implementing Lock-Free Shared-Data Structures.
SPAA 1993: 261-270 |
| 3 | EE | Greg Barnes,
Uriel Feige:
Short random walks on graphs.
STOC 1993: 728-737 |
| 1992 |
|---|
| 2 | | Greg Barnes,
Jonathan F. Buss,
Walter L. Ruzzo,
Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Structure in Complexity Theory Conference 1992: 27-33 |
| 1991 |
|---|
| 1 | | Greg Barnes,
Walter L. Ruzzo:
Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract)
STOC 1991: 43-53 |
