Ronald de Wolf
Ronald de Wolf
CWI and University of Amsterdam
Verifierad e-postadress på cwi.nl - Startsida
Titel
Citeras av
Citeras av
År
Quantum lower bounds by polynomials
R Beals, H Buhrman, R Cleve, M Mosca, R de Wolf
Journal of the ACM (JACM) 48 (4), 778-797, 2001
7692001
Quantum fingerprinting
H Buhrman, R Cleve, J Watrous, R de Wolf
Physical Review Letters 87 (16), 167902, 2001
7572001
Foundations of inductive logic programming
SH Nienhuys-Cheng, R de Wolf
Springer, 1997
6621997
Complexity measures and decision tree complexity: a survey
H Buhrman, R de Wolf
Theoretical Computer Science 288 (1), 21-43, 2002
5372002
Nonlocality and communication complexity
H Buhrman, R Cleve, S Massar, R de Wolf
Reviews of modern physics 82 (1), 665, 2010
4162010
Algorithmic clustering of music based on string compression
R Cilibrasi, P Vitányi, R de Wolf
Computer Music Journal 28 (4), 49-67, 2004
3302004
Exponential lower bound for 2-query locally decodable codes via a quantum argument
I Kerenidis, R de Wolf
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2552003
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
S Fiorini, S Massar, S Pokutta, HR Tiwary, R de Wolf
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
2362012
Private quantum channels
A Ambainis, M Mosca, A Tapp, R de Wolf
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on …, 2000
2332000
Exponential separations for one-way quantum communication complexity, with applications to cryptography
D Gavinsky, J Kempe, I Kerenidis, R Raz, R de Wolf
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
2052007
Bounds for small-error and zero-error quantum algorithms
H Buhrman, R Cleve, R de Wolf, C Zalka
Foundations of Computer Science, 1999. 40th Annual Symposium on, 358-368, 1999
1401999
A Brief Introduction to Fourier Analysis on the Boolean Cube.
R de Wolf
Theory of Computing, Graduate Surveys 1, 1-20, 2008
1312008
Communication complexity lower bounds by polynomials
H Buhrman, R de Wolf
Computational Complexity, 16th Annual IEEE Conference on, 2001., 120-130, 2001
1252001
Quantum search on bounded-error inputs
P Høyer, M Mosca, R de Wolf
Automata, Languages and Programming, 291-299, 2003
1222003
Exponential lower bounds for polytopes in combinatorial optimization
S Fiorini, S Massar, S Pokutta, HR Tiwary, R de Wolf
Journal of the ACM (JACM) 62 (2), 17, 2015
1212015
Quantum algorithms for element distinctness
H Buhrman, C Durr, M Heiligman, P Hoyer, F Magniez, M Santha, ...
Proceedings 16th Annual IEEE Conference on Computational Complexity, 131-137, 2001
1042001
Quantum communication and complexity
R de Wolf
Theoretical Computer Science 287 (1), 337-353, 2002
1032002
On computation and communication with small bias
H Buhrman, N Vereshchagin, R de Wolf
Computational Complexity, 2007. CCC'07. Twenty-Second Annual IEEE Conference …, 2007
982007
Quantum and classical strong direct product theorems and optimal time-space tradeoffs
H Klauck, R Špalek, R de Wolf
SIAM Journal on Computing 36 (5), 1472-1493, 2007
982007
Characterization of non-deterministic quantum query and quantum communication complexity
R de Wolf
Computational Complexity, 2000. Proceedings. 15th Annual IEEE Conference on …, 2000
80*2000
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20