Antunes, L., Matos, A., Souto, A., Vitányi, P. (2008) Depth as randomness deficiency.

Institute for Logic, Language and Computation.

Working paper | http://arxiv.org/abs/0809.2546 | UvA-DARE

Antunes, L., Matos, A., Souto, A., Vitányi, P. (2009) Depth as randomness deficiency.

Theory of Computing Systems, Vol. 45 (pp 724-739)

Article | https://doi.org/10.1007/s00224-009-9171-0 | UvA-DARE

Antunes, L., Souto, A., Vitányi, P.M.B. (2013) On Logical Depth and the Running Time of Shortest Programs.

ArXiv.

Preprint | https://doi.org/10.48550/arXiv.1310.6976 | UvA-DARE

Antunes, L.F., Souto, A., Vitányi, P.M.B. (2017) On the rate of decrease in logical depth.

Theoretical Computer Science, Vol. 702 (pp 60-64)

Article | https://doi.org/10.1016/j.tcs.2017.08.012 | UvA-DARE

Apers, S., de Wolf, R. (2020) Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving.

In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science: FOCS 2020 : proceedings : 16-19 November 2020, virtual conference (pp 637-648). IEEE.

Apt, K., Conitzer, V., Guo, M., Markakis, E. (2008) Welfare undominated Groves mechanisms.

In Papadimitriou, C. Zhang, S. (Eds.), Internet and Network Economics: 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008 : proceedings (pp 426-437) (Lecture Notes in Computer Science, Vol. 5385). Springer.

Apt, K. (2001) Towards Free Access to Scientific Literature.

Nieuw Archief voor Wiskunde, Vol. 5/2 (pp 251-255)

Article | http://www.nieuwarchief.nl/serie5/toonnummer.php?deel=02&nummer=3&taal=0 | UvA-DARE

Apt, K. (2011) Tafeltennis.

In Cramer, R. van Dam, S. van der Mei, R. (Eds.), Leven met getallen: liber amicorum ter gelegenheid van de pensionering van Herman te Riele (pp 16-19). CWI.

Apt, K.R., Arbab, F., Ma, H. (2007) A system for distributed mechanisms: design, implementation and applications.

SEN-R0706. Fac. Natuurwetenschappen Wiskunde en Informatica.

Report | http://db.cwi.nl/rapporten/abstract.php?abstractnr=2125 | UvA-DARE

Apt, K.R., Arbab, F., Ma, H. (2008) A distributed platform for mechanism design.

In Proceedings of the 2008 International Conference on Computational Intelligence for Modelling, Control & Automation (pp 767-772). IEEE.

Apt, K.R., Ben-Eliyahu, R. (1995) Meta-variables in Logic Programming, or in Praise of Ambivalent Syntax.

Technical Report. onbekend (FdL).

Report | UvA-DARE

Apt, K.R., Bol, R. (1994) Logic programming and negation: a survey.

Journal of Logic Programming, Vol. 19-20 (pp 9-71)

Article | UvA-DARE

Apt, K.R., Brand, S. (2003) Schedulers for rule-based constraint programming.

In Proceedings of ACM Symposium on Applied Computing (SAC) (pp 14-21). ACM.

Apt, K.R., Brand, S. (2005) Constraint-Based Qualitative Simulation.

In Proc. of the 12th International Symposium on Temporal Representation and Reasoning (pp 26-34)

Apt, K.R., Brand, S. (2005) Schedulers and Redundancy for a Class of Constraint Propagation Rules.

Theory and Practice of Logic Programming, Vol. 5 (pp 441-446)

Article | https://doi.org/10.1017/S1471068405002401 | UvA-DARE

Apt, K.R., Brand, S. (2006) Infinite Qualitative Simulations by means of Constraint Programming.

Lecture Notes in Computer Science, Vol. 4204 (pp 29-43)

Article | UvA-DARE

Apt, K.R., de Boer, F.S., Olderog, E.R., de Gouw, S. (2012) Verification of object-oriented programs: A transformational approach.

Journal of Computer and System Sciences, Vol. 78 (pp 823-852)

Article | https://doi.org/10.1016/j.jcss.2011.08.002 | UvA-DARE

Apt, K.R., de Boer, F.S., Olderog, E.R. (2009) Verification of sequential and concurrent programs: 3rd ed..

Texts in computer science. Springer.

Book | https://doi.org/10.1007/978-1-84882-745-5 | UvA-DARE

Apt, K.R., de Boer, F.S., Olderog, E.R. (2009) Modular verification of recursive programs.

In Grumberg, O. Kaminski, M. Katz, S. Wintner, S. (Eds.), Languages: from formal to natural: Essays dedicated to Nissim Francez on the occasion of his 65th birthday (pp 1-21) (Lecture notes in computer science). Springer.

Apt, K.R., Doets, H.C. (1994) A new definition of SLDNF-resolution.

Journal of Logic Programming, Vol. 18 (pp 177-190)

Article | https://doi.org/10.1016/0743-1066(94)90051-5 | UvA-DARE