×

zbMATH — the first resource for mathematics

de Wolf, Ronald Michiel

Compute Distance To:
Author ID: de-wolf.ronald Recent zbMATH articles by "de Wolf, Ronald Michiel"
Published as: De Wolf, Ronald; de Wolf; de Wolf, R.; de Wolf, Ronald
External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 59 Publications since 1996, including 1 Book

Publications by Year

Citations contained in zbMATH

47 Publications have been cited 514 times in 376 Documents Cited by Year
Quantum lower bounds by polynomials. Zbl 1127.68404
Beals, Robert; Buhrman, Harry; Cleve, Richard; Mosca, Michele; de Wolf, Ronald
89
2001
Complexity measures and decision tree complexity: a survey. Zbl 1061.68058
Buhrman, Harry; de Wolf, Ronald
80
2002
Linear vs. semidefinite extended formulations, exponential separation and strong lower bounds. Zbl 1286.90125
Fiorini, Samuel; Massar, Serge; Pokutta, Sebastian; Tiwary, Hans Raj; de Wolf, Ronald
66
2012
Exponential lower bounds for polytopes in combinatorial optimization. Zbl 1333.90107
Fiorini, Samuel; Massar, Serge; Pokutta, Sebastian; Tiwary, Hans Raj; de Wolf, Ronald
33
2015
Foundations of inductive logic programming. Zbl 1293.68014
Nienhuys-Cheng, Shan-Hwei; de Wolf, Ronald
31
1997
Quantum algorithms for element distinctness. Zbl 1081.68029
Buhrman, Harry; Dürr, Christoph; Heiligman, Mark; Høyer, Peter; Magniez, Frédéric; Santha, Miklos; de Wolf, Ronald
19
2005
Near-optimal and explicit Bell inequality violations. Zbl 1298.81034
Buhrman, Harry; Regev, Oded; Scarpa, Giannicola; de Wolf, Ronald
16
2012
Exponential lower bound for 2-query locally decodable codes via a quantum argument. Zbl 1084.68044
Kerenidis, Iordanis; de Wolf, Ronald
16
2004
Nondeterministic quantum query and communication complexities. Zbl 1026.68055
de Wolf, Ronald
16
2003
Quantum and classical strong direct product theorems and optimal time-space tradeoffs. Zbl 1123.68045
Klauck, Hartmut; Špalek, Robert; De Wolf, Ronald
14
2007
Quantum search on bounded-error inputs. Zbl 1039.68056
Høyer, Peter; Mosca, Michele; de Wolf, Ronald
13
2003
Exponential separation for one-way quantum communication complexity, with applications to cryptography. Zbl 1175.81038
Gavinsky, Dmitry; Kempe, Julia; Kerenidis, Iordanis; Raz, Ran; de Wolf, Ronald
9
2008
Quantum symmetrically-private information retrieval. Zbl 1177.68081
Kerenidis, Iordanis; De Wolf, Ronald
9
2004
Exponential lower bound for 2-query locally decodable codes via a quantum argument. Zbl 1192.81082
Kerenidis, Iordanis; de Wolf, Ronald
9
2003
Quantum communication and complexity. Zbl 1061.81016
de Wolf, Ronald
9
2002
Exponential separations for one-way quantum communication complexity, with applications to cryptography. Zbl 1232.68051
Gavinsky, Dmitry; Kempe, Julia; Kerenidis, Iordanis; Raz, Ran; de Wolf; Ronald
8
2007
Improved quantum communication complexity bounds for disjointness and equality. Zbl 1054.68064
Høyer, Peter; de Wolf, Ronald
7
2002
Improved lower bounds for locally decodable codes and private information retrieval. Zbl 1081.68028
Wehner, Stephanie; de Wolf, Ronald
6
2005
Marked PCP is decidable. Zbl 0974.68097
Halava, V.; Hirvensalo, M.; de Wolf, R.
5
2001
Some upper and lower bounds on PSD-rank. Zbl 1362.15007
Lee, Troy; Wei, Zhaohui; de Wolf, Ronald
4
2017
On the sum-of-squares degree of symmetric quadratic functions. Zbl 1380.68203
Lee, Troy; Prakash, Anupam; de Wolf, Ronald; Yuen, Henry
4
2016
Optimal quantum query bounds for almost all Boolean functions. Zbl 1354.68085
Ambainis, Andris; Bačkurs, Arturs; Smotrovs, Juris; de Wolf, Ronald
4
2013
The non-adaptive query complexity of testing \(k\)-parities. Zbl 1286.68487
Buhrman, Harry; García-Soriano, David; Matsliah, Arie; de Wolf, Ronald
4
2013
Robust polynomials and quantum algorithms. Zbl 1121.68049
Buhrman, Harry; Newman, Ilan; Rohrig, Hein; de Wolf, Ronald
4
2007
Lower bounds on matrix rigidity via a quantum argument. Zbl 1223.68050
de Wolf, Ronald
4
2006
Uniform approximation by (quantum) polynomials. Zbl 1237.81048
Drucker, Andrew; de Wolf, Ronald
3
2011
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs. Zbl 1191.68314
Ambainis, Andris; Špalek, Robert; de Wolf, Ronald
3
2009
Average-case quantum query complexity. Zbl 0959.68046
Ambainis, Andris; de Wolf, Ronald
3
2000
Fooling one-sided quantum protocols. Zbl 1354.68087
Klauck, Hartmut; de Wolf, Ronald
2
2013
New results on quantum property testing. Zbl 1245.68085
Chakraborty, Sourav; Fischer, Eldar; Matsliah, Arie; de Wolf, Ronald
2
2010
Better gap-Hamming lower bounds via better round elimination. Zbl 1305.68091
Brody, Joshua; Chakrabarti, Amit; Regev, Oded; Vidick, Thomas; de Wolf, Ronald
2
2010
A note on quantum algorithms and the minimal degree of \(\varepsilon\)-error polynomials for symmetric functions. Zbl 1161.81011
de Wolf, Ronald
2
2008
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs. Zbl 1301.81041
Ambainis, Andris; Špalek, Robert; de Wolf, Ronald
2
2006
Robust polynomials and quantum algorithms. Zbl 1118.68491
Buhrman, Harry; Newman, Ilan; Röhrig, Hein; de Wolf, Ronald
2
2005
On quantum versions of the Yao principle. Zbl 1054.68059
de Graaf, Mart; de Wolf, Ronald
2
2002
Optimal quantum sample complexity of learning algorithms. Zbl 1441.68056
Arunachalam, Srinivasan; de Wolf, Ronald
1
2018
Attacks on the AJPS Mersenne based cryptosystem. Zbl 1425.94054
de Boer, Koen; Ducas, Léo; Jeffery, Stacey; de Wolf, Ronald
1
2018
Optimal parallel quantum query algorithms. Zbl 1372.68107
Jeffery, Stacey; Magniez, Frederic; de Wolf, Ronald
1
2017
Efficient quantum algorithms for (gapped) group testing and junta testing. Zbl 1410.68132
Ambainis, Andris; Belovs, Aleksandrs; Regev, Oded; de Wolf, Ronald
1
2016
How low can approximate degree and quantum query complexity be for total Boolean functions? Zbl 1314.68133
Ambainis, Andris; De Wolf, Ronald
1
2014
Error-correcting data structures. Zbl 1267.68101
Chen, Victor; Grigorescu, Elena; de Wolf, Ronald
1
2013
New bounds on the classical and quantum communication complexity of some graph properties. Zbl 1354.68086
Ivanyos, Gábor; Klauck, Hartmut; Lee, Troy; Santha, Miklos; de Wolf, Ronald
1
2012
Simultaneous communication protocols with quantum and classical messages. Zbl 1286.68019
Gavinsky, Dmitry; Regev, Oded; de Wolf, Ronald
1
2008
Upper bounds on the noise threshold for fault-tolerant quantum computing. Zbl 1153.81467
Kempe, Julia; Regev, Oded; Unger, Falk; de Wolf, Ronald
1
2008
Quantum zero-error algorithms cannot be composed. Zbl 1175.68182
Buhrman, Harry; de Wolf, Ronald
1
2003
Average-case quantum query complexity. Zbl 1008.81010
Ambainis, Andris; de Wolf, Ronald
1
2001
A lower bound for quantum search of an ordered list. Zbl 1002.68035
Buhrman, Harry; de Wolf, Ronald
1
1999
Optimal quantum sample complexity of learning algorithms. Zbl 1441.68056
Arunachalam, Srinivasan; de Wolf, Ronald
1
2018
Attacks on the AJPS Mersenne based cryptosystem. Zbl 1425.94054
de Boer, Koen; Ducas, Léo; Jeffery, Stacey; de Wolf, Ronald
1
2018
Some upper and lower bounds on PSD-rank. Zbl 1362.15007
Lee, Troy; Wei, Zhaohui; de Wolf, Ronald
4
2017
Optimal parallel quantum query algorithms. Zbl 1372.68107
Jeffery, Stacey; Magniez, Frederic; de Wolf, Ronald
1
2017
On the sum-of-squares degree of symmetric quadratic functions. Zbl 1380.68203
Lee, Troy; Prakash, Anupam; de Wolf, Ronald; Yuen, Henry
4
2016
Efficient quantum algorithms for (gapped) group testing and junta testing. Zbl 1410.68132
Ambainis, Andris; Belovs, Aleksandrs; Regev, Oded; de Wolf, Ronald
1
2016
Exponential lower bounds for polytopes in combinatorial optimization. Zbl 1333.90107
Fiorini, Samuel; Massar, Serge; Pokutta, Sebastian; Tiwary, Hans Raj; de Wolf, Ronald
33
2015
How low can approximate degree and quantum query complexity be for total Boolean functions? Zbl 1314.68133
Ambainis, Andris; De Wolf, Ronald
1
2014
Optimal quantum query bounds for almost all Boolean functions. Zbl 1354.68085
Ambainis, Andris; Bačkurs, Arturs; Smotrovs, Juris; de Wolf, Ronald
4
2013
The non-adaptive query complexity of testing \(k\)-parities. Zbl 1286.68487
Buhrman, Harry; García-Soriano, David; Matsliah, Arie; de Wolf, Ronald
4
2013
Fooling one-sided quantum protocols. Zbl 1354.68087
Klauck, Hartmut; de Wolf, Ronald
2
2013
Error-correcting data structures. Zbl 1267.68101
Chen, Victor; Grigorescu, Elena; de Wolf, Ronald
1
2013
Linear vs. semidefinite extended formulations, exponential separation and strong lower bounds. Zbl 1286.90125
Fiorini, Samuel; Massar, Serge; Pokutta, Sebastian; Tiwary, Hans Raj; de Wolf, Ronald
66
2012
Near-optimal and explicit Bell inequality violations. Zbl 1298.81034
Buhrman, Harry; Regev, Oded; Scarpa, Giannicola; de Wolf, Ronald
16
2012
New bounds on the classical and quantum communication complexity of some graph properties. Zbl 1354.68086
Ivanyos, Gábor; Klauck, Hartmut; Lee, Troy; Santha, Miklos; de Wolf, Ronald
1
2012
Uniform approximation by (quantum) polynomials. Zbl 1237.81048
Drucker, Andrew; de Wolf, Ronald
3
2011
New results on quantum property testing. Zbl 1245.68085
Chakraborty, Sourav; Fischer, Eldar; Matsliah, Arie; de Wolf, Ronald
2
2010
Better gap-Hamming lower bounds via better round elimination. Zbl 1305.68091
Brody, Joshua; Chakrabarti, Amit; Regev, Oded; Vidick, Thomas; de Wolf, Ronald
2
2010
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs. Zbl 1191.68314
Ambainis, Andris; Špalek, Robert; de Wolf, Ronald
3
2009
Exponential separation for one-way quantum communication complexity, with applications to cryptography. Zbl 1175.81038
Gavinsky, Dmitry; Kempe, Julia; Kerenidis, Iordanis; Raz, Ran; de Wolf, Ronald
9
2008
A note on quantum algorithms and the minimal degree of \(\varepsilon\)-error polynomials for symmetric functions. Zbl 1161.81011
de Wolf, Ronald
2
2008
Simultaneous communication protocols with quantum and classical messages. Zbl 1286.68019
Gavinsky, Dmitry; Regev, Oded; de Wolf, Ronald
1
2008
Upper bounds on the noise threshold for fault-tolerant quantum computing. Zbl 1153.81467
Kempe, Julia; Regev, Oded; Unger, Falk; de Wolf, Ronald
1
2008
Quantum and classical strong direct product theorems and optimal time-space tradeoffs. Zbl 1123.68045
Klauck, Hartmut; Špalek, Robert; De Wolf, Ronald
14
2007
Exponential separations for one-way quantum communication complexity, with applications to cryptography. Zbl 1232.68051
Gavinsky, Dmitry; Kempe, Julia; Kerenidis, Iordanis; Raz, Ran; de Wolf; Ronald
8
2007
Robust polynomials and quantum algorithms. Zbl 1121.68049
Buhrman, Harry; Newman, Ilan; Rohrig, Hein; de Wolf, Ronald
4
2007
Lower bounds on matrix rigidity via a quantum argument. Zbl 1223.68050
de Wolf, Ronald
4
2006
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs. Zbl 1301.81041
Ambainis, Andris; Špalek, Robert; de Wolf, Ronald
2
2006
Quantum algorithms for element distinctness. Zbl 1081.68029
Buhrman, Harry; Dürr, Christoph; Heiligman, Mark; Høyer, Peter; Magniez, Frédéric; Santha, Miklos; de Wolf, Ronald
19
2005
Improved lower bounds for locally decodable codes and private information retrieval. Zbl 1081.68028
Wehner, Stephanie; de Wolf, Ronald
6
2005
Robust polynomials and quantum algorithms. Zbl 1118.68491
Buhrman, Harry; Newman, Ilan; Röhrig, Hein; de Wolf, Ronald
2
2005
Exponential lower bound for 2-query locally decodable codes via a quantum argument. Zbl 1084.68044
Kerenidis, Iordanis; de Wolf, Ronald
16
2004
Quantum symmetrically-private information retrieval. Zbl 1177.68081
Kerenidis, Iordanis; De Wolf, Ronald
9
2004
Nondeterministic quantum query and communication complexities. Zbl 1026.68055
de Wolf, Ronald
16
2003
Quantum search on bounded-error inputs. Zbl 1039.68056
Høyer, Peter; Mosca, Michele; de Wolf, Ronald
13
2003
Exponential lower bound for 2-query locally decodable codes via a quantum argument. Zbl 1192.81082
Kerenidis, Iordanis; de Wolf, Ronald
9
2003
Quantum zero-error algorithms cannot be composed. Zbl 1175.68182
Buhrman, Harry; de Wolf, Ronald
1
2003
Complexity measures and decision tree complexity: a survey. Zbl 1061.68058
Buhrman, Harry; de Wolf, Ronald
80
2002
Quantum communication and complexity. Zbl 1061.81016
de Wolf, Ronald
9
2002
Improved quantum communication complexity bounds for disjointness and equality. Zbl 1054.68064
Høyer, Peter; de Wolf, Ronald
7
2002
On quantum versions of the Yao principle. Zbl 1054.68059
de Graaf, Mart; de Wolf, Ronald
2
2002
Quantum lower bounds by polynomials. Zbl 1127.68404
Beals, Robert; Buhrman, Harry; Cleve, Richard; Mosca, Michele; de Wolf, Ronald
89
2001
Marked PCP is decidable. Zbl 0974.68097
Halava, V.; Hirvensalo, M.; de Wolf, R.
5
2001
Average-case quantum query complexity. Zbl 1008.81010
Ambainis, Andris; de Wolf, Ronald
1
2001
Average-case quantum query complexity. Zbl 0959.68046
Ambainis, Andris; de Wolf, Ronald
3
2000
A lower bound for quantum search of an ordered list. Zbl 1002.68035
Buhrman, Harry; de Wolf, Ronald
1
1999
Foundations of inductive logic programming. Zbl 1293.68014
Nienhuys-Cheng, Shan-Hwei; de Wolf, Ronald
31
1997
all top 5

Cited by 549 Authors

15 Ambainis, Andris
13 Pokutta, Sebastian
11 de Wolf, Ronald Michiel
10 Tiwary, Hans Raj
9 Braun, Gábor
9 Jain, Rahul
7 Fiorini, Samuel
7 Gouveia, Joao
7 Le Gall, François
7 Lee, Troy
7 Palazuelos, Carlos
7 Qiu, Daowen
7 Sherstov, Alexander A.
7 Shitov, Yaroslav Nikolaevich
6 Briët, Jop
6 Buhrman, Harry
6 Kaibel, Volker
6 Robinson, Richard Z.
6 Sun, Xiaoming
6 Thomas, Rekha R.
5 Aaronson, Scott
5 Dvir, Zeev
5 Göös, Mika
5 Montanaro, Ashley
5 Santha, Miklos
5 Weltge, Stefan
4 Avis, David M.
4 Iwama, Kazuo
4 Kerenidis, Iordanis
4 Magniez, Frédéric
4 Maksimenko, Aleksandr Nikolaevich
4 Muggleton, Stephen H.
4 Nishimura, Harumichi
4 Pitassi, Toniann
4 Shi, Yaoyun
4 Tal, Avishay
4 Tani, Seiichiro
4 Theis, Dirk Oliver
4 Woodruff, David P.
4 Yang, Yuguang
4 Zhang, Shengyu
4 Zheng, Shenggen
3 Arunachalam, Srinivasan
3 Bun, Mark
3 Childs, Andrew M.
3 Dörn, Sebastian
3 Faenza, Yuri
3 Gillis, Nicolas
3 Glineur, François
3 Grappe, Roland
3 Gruska, Jozef
3 Halava, Vesa
3 Harju, Tero
3 Ishai, Yuval
3 Jeffery, Stacey
3 Junge, Marius
3 Kabanets, Valentine
3 Khardon, Roni
3 Klauck, Hartmut
3 Kundu, Srijita
3 Lagoutte, Aurélie
3 Laurent, Monique
3 Martin, Éric A.
3 Raymond, Rudy
3 Roy, Aurko
3 Sakama, Chiaki
3 Sanyal, Swagato
3 Saraf, Shubhangi
3 Sharma, Arun K.
3 Shpilka, Amir
3 Thaler, Justin
3 Vandaele, Arnaud
3 Vidick, Thomas
3 Vihrovs, Jevgēnijs
3 Walter, Matthias
3 Wei, Zhaohui
3 Yao, Penghui
2 Arias, Marta
2 Barbato, Michele
2 Belovs, Aleksandrs
2 Berry, Dominic W.
2 Bessen, Arvid J.
2 Blais, Eric
2 Bousquet, Nicolas
2 Brassard, Gilles
2 Braverman, Mark
2 Brody, Joshua E.
2 Bury, Marc
2 Cai, Guangya
2 Choi, Byung-Soo
2 Christandl, Matthias
2 Cleve, Richard
2 Conforti, Michele
2 Cropper, Andrew
2 De Raedt, Luc
2 Dinesh, Krishnamoorthy
2 Drucker, Andrew
2 Fawzi, Hamza
2 Gavinsky, Dmitry
2 Goldreich, Oded
...and 449 more Authors
all top 5

Cited in 79 Serials

38 Theoretical Computer Science
24 Information Processing Letters
23 Mathematical Programming. Series A. Series B
20 Algorithmica
20 Computational Complexity
19 SIAM Journal on Computing
15 Quantum Information Processing
14 Journal of Computer and System Sciences
9 Machine Learning
9 Theory of Computing Systems
8 Discrete Applied Mathematics
8 Operations Research Letters
6 Communications in Mathematical Physics
5 Combinatorica
5 Journal of Complexity
5 Discrete & Computational Geometry
5 SIAM Journal on Optimization
4 Journal of Mathematical Physics
4 Information and Computation
4 SIAM Journal on Discrete Mathematics
3 Artificial Intelligence
3 Discrete Mathematics
3 Mathematics of Operations Research
3 European Journal of Combinatorics
3 MSCS. Mathematical Structures in Computer Science
3 Journal of Mathematical Sciences (New York)
3 Chicago Journal of Theoretical Computer Science
3 Journal of the ACM
3 Annals of Mathematics. Second Series
3 Theory and Practice of Logic Programming
3 Forum of Mathematics, Sigma
2 International Journal of Theoretical Physics
2 Reports on Mathematical Physics
2 Information Sciences
2 Journal of Combinatorial Theory. Series A
2 Journal of Computer Science and Technology
2 Annals of Operations Research
2 International Journal of Foundations of Computer Science
2 Linear Algebra and its Applications
2 SIAM Review
2 Distributed Computing
2 Proceedings of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
2 New Journal of Physics
2 Lobachevskii Journal of Mathematics
2 Foundations of Computational Mathematics
2 Journal of Systems Science and Complexity
2 ACM Transactions on Computation Theory
1 Linear and Multilinear Algebra
1 Mathematical Notes
1 Reviews of Modern Physics
1 Journal of Functional Analysis
1 Mathematics and Computers in Simulation
1 Studia Logica
1 Graphs and Combinatorics
1 Probability Theory and Related Fields
1 Statistical Science
1 New Generation Computing
1 International Journal of Approximate Reasoning
1 Journal of Cryptology
1 International Journal of Mathematics
1 Random Structures & Algorithms
1 Journal of Global Optimization
1 Designs, Codes and Cryptography
1 Proceedings of the National Academy of Sciences of the United States of America
1 Computational Optimization and Applications
1 Annals of Mathematics and Artificial Intelligence
1 Soft Computing
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Revista Matemática Complutense
1 Physical Review Letters
1 Journal of Machine Learning Research (JMLR)
1 Natural Computing
1 4OR
1 International Journal of Quantum Information
1 Foundations of Physics
1 Discrete Optimization
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Optimization Letters
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.