Voor de beste ervaring schakelt u JavaScript in en gebruikt u een moderne browser!
Je gebruikt een niet-ondersteunde browser. Deze site kan er anders uitzien dan je verwacht.

Prof. dr. R.M. (Ronald) de Wolf

Faculteit der Natuurwetenschappen, Wiskunde en Informatica
ILLC
Bezoekadres
  • Science Park 105
  • Kamernummer: F2.08
Postadres
  • Postbus 94242
    1090 GE Amsterdam
Contactgegevens
  • Publicaties

    2020

    • Apers, S., & de Wolf, R. (2020). Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science: FOCS 2020 : proceedings : 16-19 November 2020, virtual conference (pp. 637-648). IEEE. https://doi.org/10.1109/FOCS46700.2020.00065 [details]
    • Arunachalam, S., Belovs, A., Childs, A. M., Kothari, R., Rosmanis, A., & de Wolf, R. (2020). Quantum Coupon Collector. In S. T. Flammia (Ed.), 15th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2020, June 9-12, 2020, Riga, Latvia [10] (Leibniz International Proceedings in Informatics; Vol. 158). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.TQC.2020.10 [details]
    • Arunachalam, S., Chakraborty, S., Koucký, M., Saurabh, N., & de Wolf, R. (2020). Improved bounds on Fourier entropy and Min-entropy. In C. Paul, & M. Bläser (Eds.), 37th International Symposium on Theoretical Aspects of Computer Science: STACS 2020, March 10-13, 2020, Montpellier, France [45] (Leibniz International Proceedings in Informatics; Vol. 154). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2020.45 [details]
    • van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2020). Convex optimization using quantum oracles. Quantum - the open journal for quantum science, 4, [220]. https://doi.org/10.22331/q-2020-01-13-220 [details]
    • van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2020). Quantum SDP-Solvers: Better upper and lower bounds. Quantum - the open journal for quantum science, 4, [230]. https://doi.org/10.22331/q-2020-02-14-230 [details]

    2019

    • Arunachalam, S., Chakraborty, S., Lee, T., Paraashar, M., & de Wolf, R. (2019). Two new results about quantum exact learning. In C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Eds.), 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019, July 9-12, 2019, Patras, Greece [16] (Leibniz International Proceedings in Informatics; Vol. 132). Saarbrücken/Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2019.16 [details]
    • Sinha, M., & de Wolf, R. (2019). Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science: proceedings : 9-12 November, 2019, Baltimore, Maryland (pp. 966-981). (FOCS). Los Alamitos, CA: IEEE Computer Society. https://doi.org/10.1109/FOCS.2019.00062 [details]

    2018

    • Arunachalam, S., & de Wolf, R. (2018). Optimal Quantum Sample Complexity of Learning Algorithms. Journal of Machine Learning Research, 19, [71]. [details]
    • de Boer, K., Ducas, L., Jeffery, S., & de Wolf, R. (2018). Attacks on the AJPS Mersenne-based cryptosystem. In T. Lange, & R. Steinwandt (Eds.), Post-Quantum Cryptography: 9th International Conference, PQCrypto 2018, Fort Lauderdale, FL, USA, April 9-11, 2018 : proceedings (pp. 101-120). (Lecture Notes in Computer Science; Vol. 10786). Cham: Springer. https://doi.org/10.1007/978-3-319-79063-3_5 [details]

    2017

    2016

    • Ambainis, A., Belovs, A., Regev, O., & de Wolf, R. (2016). Efficient quantum algorithms for (gapped) group testing and junta testing. In R. Krauthgamer (Ed.), Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2016 : January 10-12, 2016, Crystal Gateway Marriott, Arlington, Virginia, USA (pp. 903-922). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974331.ch65 [details]
    • Lee, T., Prakash, A., de Wolf, R., & Yuen, H. (2016). On the sum-of-squares degree of symmetric quadratic functions. In R. Raz (Ed.), 31st Conference on Computational Complexity: CCC'16, May 29 to June 1, 2016, Tokyo, Japan [17] (Leibniz International Proceedings in Informatics; Vol. 50). Saarbrücken/Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CCC.2016.17 [details]
    • Montanaro, A., & de Wolf, R. (2016). A Survey of Quantum Property Testing. Theory of Computing, Theory of Computing Library, Graduate Surveys(7), 1-81. https://doi.org/10.4086/toc.gs.2016.007 [details]

    2015

    • Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R. (2015). Exponential Lower Bounds for Polytopes in Combinatorial Optimization. Journal of the Association for Computing Machinery, 62(2), [17]. https://doi.org/10.1145/2716307 [details]
    • Kaniewski, J., Lee, T., & de Wolf, R. (2015). Query complexity in expectation. In M. M. Halldórsson, K. Iwama, N. Kobayashi, & B. Speckmann (Eds.), Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015 : proceedings (Vol. 1, pp. 761-772). (Lecture Notes in Computer Science; Vol. 9134), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-662-47672-7_62 [details]
    • Mahadev, U., & de Wolf, R. (2015). Rational approximations and quantum algorithms with postselection. Quantum Information and Computation, 15(3&4), 297-309. [details]

    2014

    • Ambainis, A., & de Wolf, R. (2014). How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? Computational Complexity, 23(2), 305-322. https://doi.org/10.1007/s00037-014-0083-2 [details]
    • Jeffery, S., Magniez, F., & de Wolf, R. M. (2014). Optimal parallel quantum query algorithms. In European Symposium on Algorithms (ESA 14) (pp. 592-604)

    2013

    • Ambainis, A., & de Wolf, R. (2013). How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? In CCC 2013 : 2013 IEEE Conference on Computational Complexity: proceedings : 5-7 June 2013, Palo Alto, California, USA (pp. 179-184). Piscataway, NJ: IEEE. https://doi.org/10.1109/CCC.2013.26 [details]
    • Ambainis, A., Bačkurs, A., Smotrovs, J., & de Wolf, R. (2013). Optimal quantum query bounds for almost all Boolean functions. In N. Portier, & T. Wilke (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science: STACS '13, February 27th to March 2nd, 2013, Kiel, Germany (pp. 446-453). (Leibniz International Proceedings in Informatics; Vol. 20). Saarbrücken/Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2013.446 [details]
    • Buhrman, H., García-Soriano, D., Matsliah, A., & de Wolf, R. (2013). The non-adaptive query complexity of testing k-parities. Chicago Journal of Theoretical Computer Science, 2013, [6]. https://doi.org/10.4086/cjtcs.2013.006 [details]
    • Chen, V., Grigorescu, E., & de Wolf, R. (2013). Error-correcting data structures. SIAM Journal on Computing, 42(1), 84-111. https://doi.org/10.1137/110834949 [details]
    • Klauck, H., & de Wolf, R. (2013). Fooling One-Sided Quantum Protocols. In N. Portier, & T. Wilke (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science: STACS '13, February 27th to March 2nd, 2013, Kiel, Germany (pp. 424-433). (Leibniz International Proceedings in Informatics; Vol. 20). Saarbrücken/Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2013.424 [details]

    2012

    • Buhrman, H., Regev, O., Scarpa, G., & de Wolf, R. (2012). Near-Optimal and Explicit Bell Inequality Violations. Theory of Computing, 8, 623-645. [27]. https://doi.org/10.4086/toc.2012.v008a027 [details]
    • Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R. (2012). Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In STOC'12: 2012 ACM Symposium on Theory of Computing : May 19-22, 2012, New York, New York, USA (pp. 95-106). New York: ACM. https://doi.org/10.1145/2213977.2213988 [details]
    • Ivanyos, G., Klauck, H., Lee, T., Santha, M., & de Wolf, R. (2012). New bounds on the classical and quantum communication complexity of some graph properties. In D. D'Souza, T. Kavitha, & J. Radhakrishnan (Eds.), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2012, December 15-17, 2012 Hyderabad, India (pp. 148-159). (Leibniz International Proceedings in Informatics; Vol. 18). Saarbrücken/Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.148 [details]

    2011

    • Buhrman, H., Regev, O., Scarpa, G., & de Wolf, R. (2011). Near-Optimal and Explicit Bell Inequality Violations. In 26th IEEE Conference on Computational Complexity: proceedings : San Jose, California, 8-10 June 2011 (pp. 157-166). Los Alamitos, Calif.: IEEE Computer Society. https://doi.org/10.1109/CCC.2011.30 [details]
    • Drucker, A., & de Wolf, R. (2011). Quantum proofs for classical theorems. Theory of Computing, Theory of Computing Library, Graduate Surveys(2). https://doi.org/10.4086/toc.gs.2011.002 [details]
    • Drucker, A., & de Wolf, R. (2011). Uniform approximation by (quantum) polynomials. Quantum Information and Computation, 11(3&4), 215-225. [details]

    2012

    • de Wolf, R. (2012). What quantum computing can do for you. (Inaugural lecture; No. 444). Amsterdam: Vossiuspers UvA. [details]

    2014

    • de Wolf, R. M. (2014). Kwantumcomputers. Nieuw Archief voor Wiskunde, 5/15(3), 173-175.
    • de Wolf, R. M. (2014). Quantumalgoritmes en cryptografie. Nederlands Tijdschrift voor Natuurkunde, 80(6), 183-185.
    This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list.
  • Nevenwerkzaamheden
    • CWI
      Onderzoek
contactgegevens bewerken   bewerk profielinformatie