-
Troelstra, A.S. (1996) Choice sequences: a retrospect.CWI Quarterly, Vol. 9 (pp 143-149)Article | UvA-DARE
-
Troelstra, A.S. (1998) Marginalia on the sequent calculus.ML-1998. WINS (oud WINS).Report | UvA-DARE
-
Troelstra, A.S. (1998) Concepts and Axioms.In Philosophia Mathematica, series 3 (pp 195-208) (-)Chapter | UvA-DARETroelstra, A.S. (1998) Realizability.In Buss, S. (Eds.), Handbook of proof theory (pp ---) (-). North-Holland/ Elsevier.Chapter | UvA-DARETroelstra, A.S. (1999) From constructivism to computer science.Theoretical Computer Science, Vol. 211 (pp 233-252)Troelstra, A.S. (1999) Marginalia on sequent calculi.Studia Logica, Vol. 62 (pp 291-303)Article | UvA-DARETroelstra, A.S. (2000) Ware en Gevoelige Verhalen.Technical Report. Institute for Logic Language and Computation.Report | UvA-DARETroelstra, A.S. (2001) Honderd jaar keuzenrijen.Verslagen van de Afdeling Natuurkunde van de KNAW, Vol. 110 (pp 223-227)Article | UvA-DARETroelstra, A.S. (2004) Vriendenboek ofwel liber amicorum ter gelegenheid van het afscheid van Dick de Jongh.Institute for Logic, Language and Computation.Book (Editorship) | UvA-DARETroelstra, A.S. (2004) Tijgers op de Ararat.Atlas.Book | UvA-DARETroelstra, A.S. (2005) Proof Theory and Constructive Mathematics.In Mathematics: History,Concepts, and Foundations, from /Encyclopedia of Life Support Systems (EOLSS). Eolss Publishers.Chapter | UvA-DARETroelstra, A.S. (2011) History of constructivism in the 20th century.In Kennedy, J. Kossak, R. (Eds.), Set Theory, Arithmetic, and Foundations of Mathematics: Theorems, Philosophies (pp 150-179) (Lecture Notes in logic, Vol. 36). Cambridge University Press.Chapter | https://doi.org/10.1017/CBO9780511910616.009 | UvA-DARETroelstra, A.S. (2016) Checking your history.In van Eijk, J. Iemhoff, R. Joosten, J.J. (Eds.), Liber Amicorum Alberti: a tribute to Albert Visser (pp 223-230) (Tributes, Vol. 30). College Publications.Chapter | UvA-DARETromp, J., Buhrman, H., Li, M., Vitányi, P.M.B. (2000) Kolmogorov random graphs and the incompressibility method.SIAM Journal on Computing, Vol. 29 (pp 590-599)Article | https://doi.org/10.1137/S0097539797327805 | UvA-DARETromp, J., Vitányi, P.M.B. (2002) A protocol for randomized anonymous two process wait-free test-and-set with finite-state verification.In Pro. 9th International Colloquium on Structural Information and Communication Complexity (pp 275-292). Carleton University Press.Chapter | UvA-DARETromp, J., Vitányi, P.M.B. (2002) Randomized two-process wait-free test-and-set.Distributed Computing, Vol. 15 (pp 127-135)Article | https://doi.org/10.1007/s004460200071 | UvA-DARETrotman, A., Geva, S., Kamps, J., Lalmas, M., Murdock, V. (2010) Current research in focused retrieval and result aggregation.Information Retrieval, Vol. 13 (pp 407-411)Article | https://doi.org/10.1007/s10791-010-9137-5 | UvA-DARETrotman, A., Geva, S., Kamps, J. (2007) Report on the SIGIR 2007 workshop on focused retrieval.SIGIR Forum, Vol. 42 (pp 97-103)Article | UvA-DARETrotman, A., Geva, S., Kamps, J. (2008) Proceedings of the SIGIR 2007 Workshop on Focused Retrieval: held in Amsterdam, The Netherlands, 27 July 2007.University of Otago, Department of Computer Science.Book (Editorship) | http://www.cs.otago.ac.nz/sigirfocus/FullProceedings.pdf | UvA-DARETrotman, A., Geva, S., Kamps, J. (2008) Proceedings of the SIGIR 2008 Workshop on Focused Retrieval: held in Singapore, 24 July 2008.University of Otago, Department of Computer Science.Book (Editorship) | http://www.cs.otago.ac.nz/sigirfocus2008/Proceedings.pdf | UvA-DARE
The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact illc at uva.nl