Centrum Wiskunde & Informatica

Invited talk at the AIR research center at Falmouth University, Penryn, UK Presentation

C. Wang (Chen)

January 2013
Quantum knopen & verstrengelde informatie Presentation

M.S. Golden (Mark) and H.M. Buhrman (Harry)

January 2013
Optimal quantum query bounds for almost all Boolean functions In Proceedings

A. Ambainis (Andris), A. Backurs, J. Smotrovs (Juris) and R.M. de Wolf (Ronald)

January 2013
Fooling One-Sided Quantum Protocols In Proceedings

H. Klauck (Hartmut) and R.M. de Wolf (Ronald)

January 2013
Open graph drawing framework (OGDF) Book Chapter

M. Chimani, C. Gutwenger, M. Juenger, G.W. Klau (Gunnar), C.C. Klein (Cecilia) and P. Mutzel

January 2013
The non-adaptive query complexity of testing k-parities Article

Chicago Journal of Theoretical Computer Science

H.M. Buhrman (Harry), D. Garcia Soriano (David), A. Matsliah (Arie) and R.M. de Wolf (Ronald)

January 2013
How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? In Proceedings

A. Ambainis (Andris) and R.M. de Wolf (Ronald)

January 2013
Optimal parallel quantum query algorithms Tech Report

S. Jeffery (Stacey), F. Magniez and R.M. de Wolf (Ronald)

January 2013

Previous

Next