Search results
Results: 84
Number of items: 84
-
Arunachalam, S., & de Wolf, R. (2017). Guest Column: A Survey of Quantum Learning Theory. SIGACT News, 48(2), 41-67. https://doi.org/10.1145/3106700.3106710 -
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
-
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 -
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 Article 17 (Leibniz International Proceedings in Informatics; Vol. 50). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2016.17 -
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
-
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), Article 17. https://doi.org/10.1145/2716307
-
Mahadev, U., & de Wolf, R. (2015). Rational approximations and quantum algorithms with postselection. Quantum Information & Computation, 15(3&4), 297-309. https://arxiv.org/abs/1401.0912 -
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
-
Jeffery, S., Magniez, F., & de Wolf, R. (2014). Optimal parallel quantum query algorithms. In A. S. Schulz, & D. Wagner (Eds.), Algorithms - ESA 2014: 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014 : proceedings (pp. 592-604). (Lecture Notes in Computer Science; Vol. 8737), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-662-44777-2_49 -
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
Page 4 of 9