Ambainis, A. Bačkurs, A. Smotrovs, J. de Wolf, R. (2013) Optimal quantum query bounds for almost all Boolean functions.

In Portier, N. Wilke, T. (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). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.

Ambainis, A. Belovs, A. Regev, O. de Wolf, R. (2016) Efficient quantum algorithms for (gapped) group testing and junta testing.

In Krauthgamer, R. (Eds.), 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.

Ambainis, A. Buhrman, H.M. Gasarch, W.I. Kalayanasundaram, B. Torenvliet, L. (2000) The communication complexity of enumeration, elimination and selection.

In Proceedings 15th IEEE Conference on Computational Complexity (pp 44-53)

Ambainis, A. Buhrman, H.M. Gasarch, W.I. Kalayanasundaram, B. Torenvliet, L. (2001) The communication complexity of enumeration, elimination and selection.

Journal of Computer and System Sciences, Vol. 63 (pp 148-184)

Article | https://doi.org/10.1006/jcss.2001.1761 | UvA-DARE

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). IEEE.

Ambainis, A. de Wolf, R. (2014) How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?.

Computational Complexity, Vol. 23 (pp 305-322)

Article | https://doi.org/10.1007/s00037-014-0083-2 | UvA-DARE

Ambainis, A. de Wolf, R.M. (2000) Average-Case Quantum Query Complexity.

Lecture Notes in Computer Science, Vol. 1770 (pp 133-144)

Article | UvA-DARE

Ambainis, A. de Wolf, R.M. (2001) Average-case quantum query complexity.

Journal of Physics. A, Mathematical and General, Vol. 34 (pp 6741-6754)

Article | https://doi.org/10.1088/0305-4470/34/35/302 | UvA-DARE

Ambainis, A. Mosca, M. Tapp, A. de Wolf, R.M. (2000) Private quantum channels.

In Proceedings of the 41st IEEE Foundations of Computer Science (FOCS 2000) (pp 547-553)

Ambainis, A. Spalek, R. de Wolf, R.M. (2005) Quantum Direct Product Theorems for Symmetric Functions and Time-Space Tradeoffs.

Unknown Publisher.

Report | UvA-DARE

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)

Ambainis, A. Spalek, R. (2006) Quantum Algorithms for Matching and Network Flows.

Lecture Notes in Computer Science, Vol. 3884 (pp 172-183)

Article | UvA-DARE

Ambati, B.R. Deoskar, T. Steedman, M. (2016) Shift-Reduce CCG Parsing using Neural Network Models.

In Knight, K. Nenkova, A. Rambow, O. (Eds.), NAACL HLT 2016 : The 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Proceedings of the Conference : June 12-17, 2016, San Diego, California, USA (pp 447-453). The Association for Computational Linguistics.

Ambos-Spies, K. Beckmann, A. Buss, S.R. Löwe, B. (2012) Computability in Europe 2009.

Annals of Pure and Applied Logic, Vol. 163 (pp 483-620)

Special issue (Editorship) | https://www.sciencedirect.com/journal/annals-of-pure-and-applied-logic/vol/163/issue/5 | UvA-DARE

Ambos-Spies, K. Löwe, B. Merkle, W. (2009) Mathematical Theory and Computational Practice: 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009: Proceedings.

Lecture notes in computer science. Springer.

Book (Editorship) | https://doi.org/10.1007/978-3-642-03073-4 | UvA-DARE

Ambos-Spies, K. Neis, H.C. Terwijn, S.A. (1994) Genericity and measure for exponential time.

In Rovan, B. Privara, I. Ruzicka, P. (Eds.), Mathematical Foundations of Computer Science 1994 (pp 221-232) (Lecture Notes in Computer Science). Springer Verlag.

Ambos-Spies, K. Neis, H.C. Terwijn, S.A. (1996) Genericity and measure for exponential time.

Theoretical Computer Science, Vol. 168 (pp 3-19)

Article | https://doi.org/10.1016/0304-3975(96)89424-2 | UvA-DARE

Ambos-Spies, K. Terwijn, S.A. Zheng, X. (1994) Resource bounded randomness and weakly complete problems.

In Zhang, X.S Du, D.Z. (Eds.), Algorithms and Computation (pp 369-377) (Lecture Notes in Computer Science). Springer Verlag.

Amorós, L. Iezzi, A. Lauter, K. Martindale, C. Sotáková, J. (2021) Explicit connections between supersingular isogeny graphs and Bruhat–Tits trees.

In Cojocaru, A.C. Ionica, S. Lorenzo García, E. (Eds.), Women in Numbers Europe III: Research Directions in Number Theory (pp 39-73) (Association for Women in Mathematics Series, Vol. 24). Springer.

Anderson, Sheila Blanke, Tobias Dunn, Stuart (2010) Methodological commons: Arts and humanities e-science fundamentals.

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 368 (pp 3779-3796)

Article | https://doi.org/10.1098/rsta.2010.0156 | UvA-DARE