B. Vikraman-arvind, P. Das, and . Mukhopadhyay, The complexity of black-box ring problems, COCOON, pp.126-135, 2006.

A. Ambainis, Quantum Walk Algorithm for Element Distinctness, SIAM Journal on Computing, vol.37, issue.1, pp.210-239, 2007.
DOI : 10.1137/S0097539705447311

P. Vikraman-arvind, S. Mukhopadhyay, and . Srinivasan, New results on noncommutative and commutative polynomial identity testing, IEEE Conference on Computational Complexity, pp.268-279, 2008.

S. Aaronson and Y. Shi, Quantum lower bounds for the collision and the element distinctness problems, Journal of the ACM, vol.51, issue.4, pp.595-605, 2004.
DOI : 10.1145/1008731.1008735

A. E. Brouwer, A. M. Cohen, and A. N. Neumaier, Distance Regular Graphs, pp.255-256, 1989.

E. John, J. D. Hopcroft, and . Ullman, Introduction to Automata Theory, Languages and Computation, 1978.

F. Magniez and A. Nayak, Quantum Complexity of Testing Group Commutativity, Algorithmica, vol.48, issue.3, pp.221-232, 2007.
DOI : 10.1007/s00453-007-0057-8

F. Magniez, A. Nayak, J. Roland, and M. Santha, Search via quantum walk, STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp.575-584, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00639627

I. Pak, Testing commutativity of a group and the power of randomization Electronic Version at: http://www-math.mit, 2000.

H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Progress in Theoretical Computer Science, Birkhser, 1994.
DOI : 10.1007/978-1-4612-0289-9

M. Szegedy, Quantum Speed-Up of Markov Chain Based Algorithms, 45th Annual IEEE Symposium on Foundations of Computer Science, pp.32-41, 2004.
DOI : 10.1109/FOCS.2004.53