Greg Barnes

According to our database, Greg Barnes authored at least 8 papers between 1991 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models.

Greg Barnes, Jeff Edmonds

SIAM J. Comput., 1998

A Sublinear Space, Polynomial Time Algorithm for Directed <i>s</i>-<i>t</i> Connectivity.

Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber

SIAM J. Comput., 1998

1997

Undirected s-t Connectivity in Polynomial Time and Sublinear Space.

Greg Barnes, Walter L. Ruzzo

Comput. Complex., 1997

1996

Short Random Walks on Graphs.

Greg Barnes, Uriel Feige

SIAM J. Discret. Math., 1996

1993

A Method for Implementing Lock-Free Shared-Data Structures.

Greg Barnes

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract)

Greg Barnes, Jeff Edmonds

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity

Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991

Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract)

Greg Barnes, Walter L. Ruzzo

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991