[1]

M. Ajtai, J. Komlós, andE. Szemerédi: Deterministic Simulation in LOGSPACE, in:*Proc. of 19th ACM Symposium on Theory of Computing*, 1987, 132–140.

[2]

R. Armoni, M. Saks, A. Wigderson, andS. Zhou: Discrepancy sets and pseudorandom generators for combinatorial rectangles,*Proc. 37th IEEE Symposium on Foundations of Computer Science*, 1996.

[3]

J. L. Carter, M. N. Wegman: Universal classes of hash functions,*J. Comput. System Sci.*,**18** (1979), 143–154.

[4]

B. Chor, O. Goldreich: On the Power of Two-Point Based Sampling,*Journal of Complexity*,**5** (1989), 96–106.

[5]

G. Even, O. Goldreich, M. Luby, N. Nisan, andB. Boban Veliĉković: Approximations of General Independent Distributions. in:*Proc. of the 24th ACM Symposium on Theory of Computing*, 1992.

[6]

J. Friedman: Constructing*O(n* log(*n*)) size monotone formulae for the*k*th threshold function of*n* boolean variables.*SIAM J. on Computing*,**15** (1986).

[7]

O. Gabber, Z. Galil: Explicit constructions of linear-sized superconcentrators,*Journal of Computer System Science*,**22** (1981), 407–420.

[8]

J. Kahn, N. Linial, andA. Samorodnitsky: Inclusion-Exclusion: Exact and approximate,*Combinatorica*,**16** (1996), 465–477.

[9]

R. Karp, M. Pippenger, andM. Sipser:*Time-Randomness Tradeoff*, presented at the AMS conference on probabilistic computational complexity, Durham, New Hampshire, 1982.

[10]

M. Karpinski, M. Luby: Approximating the Number of Solutions to a*GF[2]* Formula,*Journal of Algorithms*,**14** (1993), 280–287.

[11]

M. Luby, B. Veliĉković: On Deterministic Approximation of DNF, in:*Proceedings of 23rd ACM Symposium on Theory of Computing*, 1991, 430–438,*Algorithmica* (special issue devoted to randomized algorithms), Vol. 16, No. 4/5, October/November 1996, 415–433.

[12]

M. Luby, A. Wigderson, andB. Veliĉković: Deterministic Approximate Counting of Depth-2 Circuits, in:*Proceedings of the Second Israeli Symposium on Theory of Computing and Systems*, 1993, 18–24.

[13]

G. A. Margulis: Explicit construction of concentrators,*Problemy Peredaĉi Informacii* 9, (1973) 71–80. (English translation in*Problems Inform. Transmission*, 1975).

[14]

N. Nisan: Pseudorandom Generators for Space-Bounded Computation,*Combinatorica*,**12** (1992), 449–461.

[15]

J. Schmidt, A. Siegel: The Spatial Complexity of oblivious*k*-probe hash functions,*SIAM Journal on Computing*,**19** (1990), 775–786.

[16]

M. Sipser: Expanders, Randomness, or Time vs. Space,*Journal of Computer and System Sciences*,**36** (1988), 379–383.

[17]

D. Zuckerman: Simulating BPP Using a General Weak Random Source,*Algorithmica*,**16** (1996), 367–391.