Pseudorandomness for network algorithms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 356-364

  Impagliazzo, Russell ^a   Nisan, Noam ^b   Wigderson, Avi ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY MODELS; DISTRIBUTED NETWORKS; NETWORK ALGORITHMS; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS;

COMPUTATION THEORY; ALGORITHMS;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; FUNCTION EVALUATION; PROGRAM PROCESSORS; RANDOM NUMBER GENERATION; RANDOM PROCESSES; RECURSIVE FUNCTIONS;

EXPANDERS; NETWORK ALGORITHMS; PSEUDORANDOMNESS THEORY; YAO'S TWO PARTY COMMUNICATION COMPLEXITY MODEL;

EID: 0028022375     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195190     Document Type: Conference Paper

References (20)

1. N. Alon and F. R. K. Chung. Explicit Constructions of Linear Sized Tolerant Networks. In Discrete Mathematics 72, pp. 1519, 1988.
2. [AS90] N. Alon, P. Seymour. A Separator Theorem for Graphs with an Excluded Minor and its Applications. In Proc. of the 22nd STOC, pp. 293-299, 1990.
3. [AW85] M. Ajtai and A. Wigderson. Deterministic simulation of probabilistic constant depth circuits. In 26th FOCS, pages 11-19, 1985.
4. [BFNW] L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. Bpp has subexponential time simulations unless exptime has pub- lishable proofs. To appear in Journal of Complexity Theory.1992.
5. [BM82] M. Blum and S. Micali. How to generate cryptographically strong sequences ofpseudo-random bits. In 23rd, FOCS, pages 112-117, 1982.
6. [BNS89] L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols and Logspace-hard pseudo-random sequences. In 21st STOC, pages 1-11, 1989.
7. [GKL88] O. Goldreich, H. Krawcyzk, M. Luby. On the Existence of Pseudorandom Generators. In 29th FOCS, pp. 12-24, 1988.
8. [Has90] J. Hastad. Pseudorandom generators under uniform assumptions, In 22nd STOC, pp 395-404, 1990.
9. [ILL89] R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random number generation from one-way functions. In 21st STOC, pages 12-24, 1989.
10. [LPS86] A. Lubotzky, R. Phillips, and P. Sarnak. Explicit expanders and the Ramanujan conjectures. In 18th Annual ACM Symposium on Theory of Computing, pages 240246, 1986.
11. [LT79] R. J. Lipton, R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, pp. 177-189, 1979.
12. [LVW93] M. Luby, B. Velickovic, A. Wigderson. Deterministic Approximate Counting of Depth-2 Circuits. In Proc. of the 2nd ISTCS (Israeli Symposium on Theoretical Computer Science), pp. 18-24, 1993.
13. [Nis91] N. Nisan. Pseudorandom bits for constant depth circuits. In Combinatorica 11 (1), pp. 63-70, 1991.
14. [Nis92] N. Nisan. Pseudo-random sequences for space bounded computation. In Combina-Torica 12 (4), pp 449-461, 1992.
15. [NW88] N. Nisan and A. Wigderson. Hardness vs. randomness. In FOCS, 1988.
16. [NZ93] N. Nisan and D. Zuckerman. More deterministic simulation in Logspace. In STOC, 1993.
17. [Re92] B. Read. Finding Approximate Separators and Computing Tree-Width Quickly. In Proc. of the 24th STOC, pp. 221-228, 1992.
18. [We87] I. Wegener. The complexity of Boolean functions, Wiley-Teubner, 1987.
19. [Y79] A. C.-C. Yao. Some complexity questions related to distributive computing. In Pro-ceedings of 11th STOC, pp. 209-213 1979.
20. [Yao82] A. C. Yao. Theory and applications of trapdoor functions. In FOCS, pages 80-91, 1982.