O. Noga-alon, J. Goldreich, R. Håstad, and . Peralta, Simple construction of almost k-wise independent random variables. Random Struct, Algorithms, vol.3, issue.3, pp.289-304, 1992.

V. Arvind, P. P. Kurur, and T. C. Vijayaraghavan, Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy, 20th Annual IEEE Conference on Computational Complexity (CCC'05), pp.13-27, 2005.
DOI : 10.1109/CCC.2005.7

R. Noga-alon, S. Panigrahy, and . Yekhanin, Deterministic approximation algorithms for the nearest codeword problem, In APPROX-RANDOM, pp.339-351, 2009.

Y. Noga-alon and . Roichman, Random Cayley Graphs and Expanders. Random Structures and Algorithms, pp.271-285, 1994.

]. V. As09a, S. Arvind, and . Srinivasan, Circuit Complexity, Help Functions and the Remote point problem. manuscript. [AS09b] V. Arvind and Srikanth Srinivasan. The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets ECCC Report TR09-105. Can be found at http, 2009.

Y. Azar, R. Motwani, and J. Naor, Approximating Probability Distributions Using Small Sample Spaces, COMBINATORICA, vol.18, issue.2, pp.151-171, 1998.
DOI : 10.1007/PL00009813
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.6353

S. Hoory, N. Linial, and A. Wigderson, Expander graphs and their applications, Bulletin of the American Mathematical Society, vol.43, issue.04, pp.439-561, 2006.
DOI : 10.1090/S0273-0979-06-01126-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.6788

E. M. Luks, Parallel algorithms for permutation groups and graph isomorphism, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.292-302, 1986.
DOI : 10.1109/SFCS.1986.39

E. M. Luks, Permutation groups and polynomial time computation. Groups and Computation I, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.11, pp.139-174, 1993.
DOI : 10.1090/dimacs/011/11

P. Mckenzie and S. Cook, The Parallel Complexity of Abelian Permutation Group Problems, MZ09] Raghu Meka and David Zuckerman. Small-Bias Spaces for Group Products. APPROX-RANDOM 2009, pp.880-909, 1987.
DOI : 10.1137/0216058

J. Naor and M. Naor, Small-bias probability spaces: Efficient constructions and applications Probabilistic construction of deterministic algorithms: Approximating packing integer programs, Rag88] Prabhakar Raghavan, pp.838-856130, 1988.

O. Reingold, Undirected connectivity in log-space, Journal of the ACM, vol.55, issue.4, 2008.
DOI : 10.1145/1391289.1391291

G. Leslie and . Valiant, Graph-Theoretic Arguments in Low-Level Complexity, Proceedings Mathematical Foundations of Computer Science, pp.162-176, 1977.