Alonso, O., Kamps, J., Karlgren, J. (2012) Report on the fourth workshop on exploiting semantic annotations in information retrieval (ESAIR'11).

SIGIR Forum, Vol. 46 (pp 56-64)

Article | https://doi.org/10.1145/2215676.2215682 | UvA-DARE

Alonso, O., Kamps, J., Karlgren, J. (2014) ESAIR’14: proceedings of the 7th International Workshop on Exploiting Semantic Annotations in Information Retrieval : November 7, 2014, Shanghai, China.

ACM.

Book (Editorship) | http://dl.acm.org/citation.cfm?id=2663712 | UvA-DARE

Alonso, O., Kamps, J., Karlgren, J. (2014) Seventh Workshop on Exploiting Semantic Annotations in Information Retrieval (ESAIR'14): CIKM 2014 workshop.

In CIKM '14: proceedings of the 2014 ACM International Conference on Information and Knowledge Management: November 3-7, 2014, Shanghai, China (pp 2094-2095). Association for Computing Machinery.

Alstein, D., Hoepman, J.H., Olivier, B.E., van der Put, P.I.A. (1994) Self-Stabilizing Mutual Exclusion on Directed Graphs (extended abstract).

In Backer, E. (Eds.), Computing science in the Netherlands: proceedings: CSN 94 (pp 42-53). Stichting Mathematisch Centrum.

Amano, K., Vitányi, P.M.B., Watanabe, O. (2000) On the length of the Monopolist Game.

Computing, Vol. 2000 (pp 41-48)

Article | UvA-DARE

Ambainis, A., Buhrman, H., 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., 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. (2000) Average-Case Quantum Query Complexity.

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

Article | UvA-DARE

Ambainis, A., de Wolf, R. (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., 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., Mosca, M., Tapp, A., de Wolf, R. (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. (2005) Quantum Direct Product Theorems for Symmetric Functions and Time-Space Tradeoffs.

Unknown Publisher.

Report | UvA-DARE

Ambainis, A., Spalek, R., de Wolf, R. (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

Ambos-Spies, K., Beckmann, A., Buss, S., 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.

Andrade, E. (2009) Compositionality from a "use-theoretic" perspective.

In Munz, V.A. Puhl, K. Wang, J. (Eds.), Language and world: Pre-proceedings of 32nd International Wittgenstein Symposium (pp 25-26)