Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
A \((\log n )^{4/3}\) space algorithm for (s,t) connectivity in undirected graphs
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
R. Armoni
A. Ta-Shma
A. Wigderson
S. Zhou
Publication:
Preliminary version in Proceedings of the 29th Symposium on the Theory of Computing (STOC), pp. 230-239, 1997.
Journal of the ACM, vol. 47, no. 2, 294-311, 2000.
Year:
2000
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/atwz99.pdf
Hide
Files
File:
Journal version (pdf)
Journal version (ps)
bibTeX
‹ A Trade-off Between Search and Update Time for the Implicit Dictionary Problem
up
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents ›