References
M. Ajtai, J. Komlós, andE. Szemerédi: Deterministic simulation in LOGSPACE,STOC, (1987), 132–139.
N. Alon: Eigenvalues and expanders,Combinatorica,6 (2) (1986), 83–96.
N. Alon: Eigenvalues, geometric expanders, sorting in rounds and ramsey theory,Combinatorica,6 (6) (1986), 207–219.
M. Blum: Independent unbiased coin flips from a correlated sources: a finite state markov chain,FOCS, (1984), 425–433.
Andrei Broder, andEli Shamir: On the second eigenvalue of random regular graphs, In28th Annual Symposium on Foundations of Computer Science, (1987) 286–294.
F. Bruhat, andJ. Tits:Publ. Math. IHES, 1971.
B. Chor, andO. Goldriech: Unbiased bits from sources of weak randomness and probabilistic communication complexity,FOCS, (1985), 429–442.
F. R. K. Chung: Diameters and eigenvalues,J. AMS. 2 (1989), 187–196.
A. Cohen, andA. Wigderson: Dispersers, deterministic amplification, and weak random sources,FOCS, (1989), 14–19.
J. Friedman, J. Kahn, andE. Szemerédi: On the second eigenvalue of random graphs,STOC, (1989), 587–598.
J. Friedman: On the second eigenvalue and random walks of randomd-regular graphs, Technical report, Princeton University, August 1988;Combinatorica,11 (4) (1991) 331–362.
J. Friedman: Some graphs with small second eigenvalue. Technical report, Princeton University, October 1989;Combinatorica,15 (1) (1995), 31–42.
M. Hall:Combinatorial Theory, John Wiley & Sons, 2nd edition, 1986.
R. Impagliazzo, andD. Zuckerman: How to recycle random bits,FOCS, (1989), 248–253.
N. Katz: An estimate for character sums,J. AMS,2 (1989), 197–200.
A. Lubotzky, R. Phillips, andP. Sarnak: Explicit expanders and the ramanujan conjectures, In18th Annual ACM Symposium on Theory of Computing, (1986), 240–246.
G. Margulis: Explicit group theoretic constructions of combinatorial schemes and their applications for construction of expanders and concentrators,J. of Problems of Information Transmission,24 (1988), 39–46.
N. Nisan, andA. Wigderson: Hardness vs. randomness,FOCS, (1988), 2–11.
Alain Robert:Introduction to the Representation Theory of Compact and Locally Compact Groups, Cambridge University Press, Cambridge, 1983.
M. Santha: On using deterministic functions to reduce randomness in probabilistic algorithms, 1986: manuscript.
M. Sipser: Expanders randomness or time versus space,Structure and Complexity Theory, 1986.
M. Santha, andU. V. Vazirani: Generating quasi-random sequences from slightly random sources,FOCS, (1984), 434–440.
U. V. Varirani, andV. V. Vazirani: Random polynomial time is equal to slightly random polynomial time,FOCS, (1985), 417–428.
E. Wigner: Characteristic vectors of bordered matrices with infinite dimensions,Annals of Math.,63 (3) (1955), 548–564.
D. Zuckerman: Simulating BPP using a general weak random source,FOCS, (1991), 79–89.
Author information
Authors and Affiliations
Additional information
The author wishes to acknowledge the National Science Foundation for supporting this research in part under Grant CCR-8858788, and the Office of Naval Research under Grant N00014-87-K-0467.