Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 14
Number of items: 14
  • Klauck, H., Špalek, R., & de Wolf, R. (2007). Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM Journal on Computing, 36(5), 1472-1493. https://doi.org/10.1137/05063235X
  • Ambainis, A., & Spalek, R. (2006). Quantum Algorithms for Matching and Network Flows. Lecture Notes in Computer Science, 3884, 172-183.
  • Hoyer, P., Lee, T. J., & Spalek, R. (2006). Negative weights makes adversaries stronger. Berkeley University.
  • Spalek, R., & Szegedy, M. (2006). All Quantum Adversary Methods are Equivalent. Theory of Computing, 2(1), 1-18.
  • Ambainis, A., Spalek, R., & de Wolf, R. M. (2006). A New Quantum Lower Bound Method, with Applications to Direct ProductTheorems and Time-Space Tradeoffs. In Proceedings of 38th Annual ACM Symposium on Theory of Computing (STOC'06) (pp. 618-633).
  • Buhrman, H. M., & Spalek, R. (2006). Quantum Verification of Matrix Products. In Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06) (pp. 880-889). ACM Press.
  • Open Access
    Spalek, R. (2006). Quantum Algorithms, Lower Bounds, and Time-Space Tradeoffs. [Thesis, fully internal, Universiteit van Amsterdam]. ILLC.
  • Hoyer, P., & Spalek, R. (2005). Tight adversary bounds for composite functions. Unknown Publisher. http://homepages.cwi.nl/~sr/papers/compose.pdf
  • Ambainis, A., Spalek, R., & de Wolf, R. M. (2005). Quantum Direct Product Theorems for Symmetric Functions and Time-Space Tradeoffs. Unknown Publisher.
  • Hoyer, P., & Spalek, R. (2005). Lower Bounds on Quantum Query Complexity. Bulletin of the European Association for Theoretical Computer Science, 87, 78-103. http://www.eatcs.org/images/bulletin/beatcs87.pdf
Page 1 of 2