Travelled to:1 × Iceland
1 × Italy
1 × Japan
1 × Portugal
1 × The Netherlands
4 × USA
Collaborated with:J.Kempe I.Kerenidis O.Regev ∅ S.Wehner D.Gavinsky J.Kaniewski T.Lee A.Ambainis R.Spalek P.Høyer M.Mosca F.Unger S.Fiorini S.Massar S.Pokutta H.R.Tiwary R.Raz
Talks about:bound (8) quantum (7) lower (5) exponenti (4) complex (3) separ (3) communic (2) argument (2) applic (2) queri (2)
Person: Ronald de Wolf
DBLP: Wolf:Ronald_de
Contributed to:
2015
20122008200720062006200520032003Wrote 10 papers:
- ICALP-v1-2015-KaniewskiLW #complexity #query
- Query Complexity in Expectation (JK, TL, RdW), pp. 761–772.
- STOC-2012-FioriniMPTW #bound #exponential #linear
- Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds (SF, SM, SP, HRT, RdW), pp. 95–106.
- ICALP-A-2008-KempeRUW #bound #fault tolerance #quantum
- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing (JK, OR, FU, RdW), pp. 845–856.
- STOC-2007-GavinskyKKRW #communication #complexity #encryption #exponential #quantum
- Exponential separations for one-way quantum communication complexity, with applications to cryptography (DG, JK, IK, RR, RdW), pp. 516–525.
- ICALP-v1-2006-Wolf #bound #matrix #quantum
- Lower Bounds on Matrix Rigidity Via a Quantum Argument (RdW), pp. 62–71.
- STOC-2006-AmbainisSW #bound #quantum #theorem #trade-off
- A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs (AA, RS, RdW), pp. 618–633.
- STOC-2006-GavinskyKRW #bound #communication #complexity #exponential #identification #quantum
- Bounded-error quantum state identification and exponential separations in communication complexity (DG, JK, OR, RdW), pp. 594–603.
- ICALP-2005-WehnerW #bound #information retrieval
- Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval (SW, RdW), pp. 1424–1436.
- ICALP-2003-HoyerMW #bound #quantum
- Quantum Search on Bounded-Error Inputs (PH, MM, RdW), pp. 291–299.
- STOC-2003-KerenidisW #bound #exponential #quantum
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (IK, RdW), pp. 106–115.