A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Monotone circuits for connectivity have depth (log n)2-o(1) (extended abstract)
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The complexity of planarity testing
Information and Computation
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Undirected connectivity in log-space
Journal of the ACM (JACM)
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Hi-index | 0.00 |