Universal traversal sequences for expander graphs
Information Processing Letters
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computational Complexity
Sampling adsorbing staircase walks using a new Markov chain decomposition method
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Bipartite Subgraphs and the Smallest Eigenvalue
Combinatorics, Probability and Computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
SIGACT news complexity theory column 51
ACM SIGACT News
A combinatorial construction of almost-ramanujan graphs using the zig-zag product
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Undirected connectivity in log-space
Journal of the ACM (JACM)
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Pseudorandom generators for group products: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
Near-Optimal expanding generator sets for solvable permutation groups
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squaring the graph does, yet only increases the degree of the graph by a constant factor, instead of squaring the degree. One application of this product is an alternative proof of Reingold's recent breakthrough result that S-T Connectivity in Undirected Graphs can be solved in deterministic logspace.