Derandomized squaring of graphs

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 436-447

  Rozenman, Eyal ^a   Vadhan, Salil ^b  

^a HARVARD UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; RANDOM PROCESSES;

CONSTANT FACTORS; DERANDOMIZED SQUARING; GRAPH SQUARING; LOGSPACE;

GRAPHIC METHODS;

EID: 26944493764     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_37     Document Type: Conference Paper

References (13)

1. +] R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, 1979), pages 218-223. IEEE, New York, 1979.
2. [AFWZ] N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized graph products. Comput. Complexity, 5(1):60-75, 1995.
3. [AS] N. Alon and B. Sudakov. Bipartite subgraphs and the smallest eigenvalue. Combin. Probab. Comput., 9(1):1-12, 2000.
4. [GG] O. Gabber and Z. Galil. Explicit Constructions of Linear-Sized Superconcentrators. J. Comput. Syst. Sci., 22(3):407-420, June 1981.
5. [HW] S. Hoory and A. Wigderson. Universal Traversal Sequences for Expander Graphs. Inf. Process. Lett., 46(2):67-69, 1993.
6. [INW] R. Impagliazzo, N. Nisan, and A. Wigderson. Pseudorandomness for Network Algorithms. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 356-364, Montréal, Québec, Canada, 23-25 May 1994.
7. [MR] R. A. Martin and D. Randall. Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 492-502, Redondo Beach, CA, 17-19 Oct. 2000. IEEE.
8. [Mih] M. Mihail. Conductance and convergence of markov chains: a combinatorial treatment of expanders. In In Proc. of the 37th Conf. on Foundations of Computer Science, pages 526-531, 1989.
9. [RTV] Reingold, Trevisan, and Vadhan. Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem. In ECCCTR: Electronic Colloquium on Computational Complexity, technical reports, 2005.
10. [Rei] O. Reingold. Undirected ST-connectivity in log-space. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 376-385, New York, NY, USA, 2005. ACM Press.
11. [RTV] O. Reingold, L. Trevisan, and S. Vadhan. Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem. Electronic Colloquium on Computational Complexity Technical Report TR05-022, February 2005. http://www.eccc.uni-trier.de/eccc.
12. [RVW] O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. of Math. (2), 155(1):157-187, 2002.
13. [Sav] W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities. J. Comput. System. Sci., 4:177-192, 1970.