2009 | ||
---|---|---|
73 | EE | Jop Briet, Ronald de Wolf: Locally Decodable Quantum Codes. STACS 2009: 219-230 |
72 | EE | Ronald de Wolf: Error-Correcting Data Structures. STACS 2009: 313-324 |
2008 | ||
71 | EE | Avraham Ben-Aroya, Oded Regev, Ronald de Wolf: A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. FOCS 2008: 477-486 |
70 | EE | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf: Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) 2008: 845-856 |
69 | EE | Ronald de Wolf: Error-Correcting Data Structures CoRR abs/0802.1471: (2008) |
68 | EE | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf: Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM J. Comput. 38(5): 1695-1708 (2008) |
67 | EE | Ronald de Wolf: A Brief Introduction to Fourier Analysis on the Boolean Cube. Theory of Computing, Graduate Surveys 1: 1-20 (2008) |
2007 | ||
66 | EE | Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf: On Computation and Communication with Small Bias. IEEE Conference on Computational Complexity 2007: 24-32 |
65 | EE | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf: Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC 2007: 516-525 |
64 | EE | Hartmut Klauck, Robert Spalek, Ronald de Wolf: Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM J. Comput. 36(5): 1472-1493 (2007) |
63 | EE | Ronald de Wolf: Joint review of "An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger, " Birkhäuser, ISBN: 0817641270; Quantum Computing by Mika Hirvensalo, " Springer, ISBN: 3540667830; and "Classical and Quantum Computation by A. Yu. Kitaev, A. Shen, and M. N. Vyalyi, " American Mathematical Society, ISBN: 082182161X. SIGACT News 38(1): 14-17 (2007) |
62 | EE | Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf: Robust Polynomials and Quantum Algorithms. Theory Comput. Syst. 40(4): 379-395 (2007) |
2006 | ||
61 | EE | Ronald de Wolf: Lower Bounds on Matrix Rigidity Via a Quantum Argument. ICALP (1) 2006: 62-71 |
60 | EE | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting. IEEE Conference on Computational Complexity 2006: 288-298 |
59 | EE | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-error quantum state identification and exponential separations in communication complexity. STOC 2006: 594-603 |
58 | EE | Andris Ambainis, Robert Spalek, Ronald de Wolf: A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. STOC 2006: 618-633 |
57 | EE | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting CoRR abs/quant-ph/0603173: (2006) |
56 | EE | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function CoRR abs/quant-ph/0607174: (2006) |
55 | EE | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. Electronic Colloquium on Computational Complexity (ECCC) 13(086): (2006) |
2005 | ||
54 | EE | Stephanie Wehner, Ronald de Wolf: Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. ICALP 2005: 1424-1436 |
53 | EE | Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf: Robust Polynomials and Quantum Algorithms. STACS 2005: 593-604 |
52 | EE | Ronald de Wolf: Lower Bounds on Matrix Rigidity via a Quantum Argument CoRR abs/quant-ph/0505188: (2005) |
51 | EE | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity CoRR abs/quant-ph/0511013: (2005) |
50 | EE | Andris Ambainis, Robert Spalek, Ronald de Wolf: A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs CoRR abs/quant-ph/0511200: (2005) |
49 | EE | Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf: Quantum Algorithms for Element Distinctness. SIAM J. Comput. 34(6): 1324-1330 (2005) |
2004 | ||
48 | EE | Hartmut Klauck, Robert Spalek, Ronald de Wolf: Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS 2004: 12-21 |
47 | EE | Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf: Algorithmic Clustering of Music. WEDELMUSIC 2004: 110-117 |
46 | EE | Hartmut Klauck, Robert Spalek, Ronald de Wolf: Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs CoRR quant-ph/0402123: (2004) |
45 | EE | Stephanie Wehner, Ronald de Wolf: Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval CoRR quant-ph/0403140: (2004) |
44 | EE | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Quantum Communication Cannot Simulate a Public Coin CoRR quant-ph/0411051: (2004) |
43 | EE | Hartmut Klauck, Robert Spalek, Ronald de Wolf: Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs Electronic Colloquium on Computational Complexity (ECCC)(045): (2004) |
42 | EE | Iordanis Kerenidis, Ronald de Wolf: Quantum symmetrically-private information retrieval. Inf. Process. Lett. 90(3): 109-114 (2004) |
41 | EE | Iordanis Kerenidis, Ronald de Wolf: Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69(3): 395-420 (2004) |
2003 | ||
40 | EE | Peter Høyer, Michele Mosca, Ronald de Wolf: Quantum Search on Bounded-Error Inputs. ICALP 2003: 291-299 |
39 | EE | Iordanis Kerenidis, Ronald de Wolf: Exponential lower bound for 2-query locally decodable codes via a quantum argument. STOC 2003: 106-115 |
38 | EE | Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf: Algorithmic Clustering of Music CoRR cs.SD/0303025: (2003) |
37 | EE | Peter Høyer, Michele Mosca, Ronald de Wolf: Quantum Search on Bounded-Error Inputs CoRR quant-ph/0304052: (2003) |
36 | EE | Iordanis Kerenidis, Ronald de Wolf: Quantum Symmetrically-Private Information Retrieval CoRR quant-ph/0307076: (2003) |
35 | EE | Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf: Robust Quantum Algorithms and Polynomials CoRR quant-ph/0309220: (2003) |
34 | EE | Harry Buhrman, Ronald de Wolf: Quantum zero-error algorithms cannot be composed. Inf. Process. Lett. 87(2): 79-84 (2003) |
33 | EE | Ronald de Wolf: Nondeterministic Quantum Query and Communication Complexities. SIAM J. Comput. 32(3): 681-699 (2003) |
2002 | ||
32 | EE | Peter Høyer, Ronald de Wolf: Improved Quantum Communication Complexity Bounds for Disjointness and Equality. STACS 2002: 299-310 |
31 | EE | Mart de Graaf, Ronald de Wolf: On Quantum Versions of the Yao Principle. STACS 2002: 347-358 |
30 | EE | Iordanis Kerenidis, Ronald de Wolf: Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument CoRR quant-ph/0208062: (2002) |
29 | EE | Harry Buhrman, Ronald de Wolf: Quantum Zero-Error Algorithms Cannot be Composed CoRR quant-ph/0211029: (2002) |
28 | EE | Iordanis Kerenidis, Ronald de Wolf: Exponential Lower Bound for 2-Query Locally Decodable Codes Electronic Colloquium on Computational Complexity (ECCC)(059): (2002) |
27 | Ronald de Wolf: Quantum communication and complexity. Theor. Comput. Sci. 287(1): 337-353 (2002) | |
26 | Harry Buhrman, Ronald de Wolf: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1): 21-43 (2002) | |
2001 | ||
25 | EE | Harry Buhrman, Ronald de Wolf: Communication Complexity Lower Bounds by Polynomials. IEEE Conference on Computational Complexity 2001: 120-130 |
24 | EE | Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf: Quantum Algorithms for Element Distinctness. IEEE Conference on Computational Complexity 2001: 131-137 |
23 | EE | Peter Høyer, Ronald de Wolf: Improved Quantum Communication Complexity Bounds for Disjointness and Equality CoRR quant-ph/0109068: (2001) |
22 | EE | Mart de Graaf, Ronald de Wolf: On Quantum Versions of the Yao Principle CoRR quant-ph/0109070: (2001) |
21 | EE | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf: Quantum lower bounds by polynomials. J. ACM 48(4): 778-797 (2001) |
20 | EE | Vesa Halava, Mika Hirvensalo, Ronald de Wolf: Marked PCP is decidable. Theor. Comput. Sci. 255(1-2): 193-204 (2001) |
2000 | ||
19 | Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf: Private Quantum Channels. FOCS 2000: 547-553 | |
18 | EE | Ronald de Wolf: Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity. IEEE Conference on Computational Complexity 2000: 271-278 |
17 | EE | Andris Ambainis, Ronald de Wolf: Average-Case Quantum Query Complexity. STACS 2000: 133-144 |
16 | EE | Ronald de Wolf: Nondeterministic Quantum Query and Quantum Communication Complexities CoRR cs.CC/0001014: (2000) |
1999 | ||
15 | EE | Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka: Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS 1999: 358-368 |
14 | EE | Vesa Halava, Mika Hirvensalo, Ronald de Wolf: Decidability and Undecidability of Marked PCP. STACS 1999: 207-216 |
13 | EE | Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka: Bounds for Small-Error and Zero-Error Quantum Algorithms CoRR cs.CC/9904019: (1999) |
12 | EE | Harry Buhrman, Ronald de Wolf: Communication Complexity Lower Bounds by Polynomials CoRR cs.CC/9910010: (1999) |
11 | EE | Andris Ambainis, Ronald de Wolf: Average-Case Quantum Query Complexity CoRR quant-ph/9904079: (1999) |
10 | EE | Harry Buhrman, Ronald de Wolf: A Lower Bound for Quantum Search of an Ordered List. Inf. Process. Lett. 70(5): 205-209 (1999) |
1998 | ||
9 | EE | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf: Quantum Lower Bounds by Polynomials. FOCS 1998: 352-361 |
8 | EE | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf: Quantum Lower Bounds by Polynomials CoRR quant-ph/9802049: (1998) |
7 | EE | Harry Buhrman, Ronald de Wolf: Lower Bounds for Quantum Search and Derandomization CoRR quant-ph/9811046: (1998) |
1997 | ||
6 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf: Foundations of Inductive Logic Programming Springer 1997 | |
1996 | ||
5 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf: A Complete Method for Program Specialization Based on Unfolding. ECAI 1996: 438-442 | |
4 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf: Least Generalizations under Implication. Inductive Logic Programming Workshop 1996: 285-298 | |
3 | EE | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf: Least Generalizations and Greatest Specializations of Sets of Clauses CoRR cs.AI/9605102: (1996) |
2 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf: Least Generalizations and Greatest Specializations of Sets of Clauses. J. Artif. Intell. Res. (JAIR) 4: 341-363 (1996) | |
1995 | ||
1 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf: The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution. ASIAN 1995: 269-285 |