Lower bounds for local search by quantum arguments, Proc. STOC 2004, pp.465-474, 2004. ,
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
Polynomial degree vs. quantum query complexity, Journal of Computer and System Sciences, vol.72, issue.2, pp.220-238, 2006. ,
DOI : 10.1016/j.jcss.2005.06.006
Sampling algorithms, Proceedings of the thirty-third annual ACM symposium on Theory of computing , STOC '01, pp.266-275, 2001. ,
DOI : 10.1145/380752.380810
Quantum lower bounds by polynomials, Journal of the ACM, vol.48, issue.4, pp.778-797, 2001. ,
DOI : 10.1145/502090.502097
Quantum Query Complexity of Some Graph Problems, SIAM Journal on Computing, vol.35, issue.6, pp.1310-1328, 2006. ,
DOI : 10.1137/050644719
Hidden translation and orbit coset in quantum computing, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, 2003. ,
DOI : 10.1145/780542.780544
Quantum search for multiple items using parallel queries. arXiv, 2004. ,
Lower bounds on quantum query complexity, EATCS Bulletin, vol.87, pp.78-103, 2005. ,
On the probabilistic query complexity of transitively symmetric problems ,
URL : https://hal.archives-ouvertes.fr/hal-00120934
A Quantum Lower Bound for the Query Complexity of Simon???s Problem, Proc. ICALP 2005, pp.1287-1298, 2005. ,
DOI : 10.1007/11523468_104
The quantum query complexity of the abelian hidden subgroup problem, Theoretical Computer Science, vol.380, issue.1-2, pp.115-126, 2007. ,
DOI : 10.1016/j.tcs.2007.02.057
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments, SIAM journal on Computing ,
An algorithmic argument for nonadaptive query complexity lower bounds on advised quantum computation (extended abstract), MFCS, pp.827-838, 2004. ,
On the time required to check properties of graphs: A problem, SIGACT News, pp.15-16, 1973. ,
On the power of quantum computation, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp.116-123, 1994. ,
All Quantum Adversary Methods Are Equivalent, Proc. ICALP 2005, pp.1299-1311, 2005. ,
DOI : 10.1007/11523468_105