Searchable List of Research Output

Filter Publications
  • Li, M., Vitanyi, P.M.B. (1996) Space-Energy Trade-off in Reversible Simulations.
    In 4th Workshop on Physics and Computation
    Chapter | UvA-DARE
  • Li, M., Vitanyi, P.M.B. (1996) Reversibility and adiabatic computation: trading time and space for energy.
    In Proc. Royal Society of London (pp 769-789) (A). Royal Society of London.
    Chapter | UvA-DARE
  • Li, M., Vitanyi, P.M.B. (1996) Ideal MDL and Its Relation To Bayesianism.
    In Proc. ISIS: Information, Statistics and Induction in Science, Melbourne, Australia (pp 282-291)
    Chapter | UvA-DARE
  • Li, M., Vitanyi, P.M.B. (1997) Average-case analysis using kolmogorov complexity.
    In Advances in Algorithms, Languages, and Complexity (pp 157-169). Kluwer Academic Publishers.
    Chapter | UvA-DARE
  • Li, M., Vitanyi, P.M.B. (1997) Average-case analysis via incompressibility.
    In Proc. 11th Conference on Fundamentals of Computation Theory (pp 38-50) (Lecture Notes in Computer Science). Springer-Verlag.
    Chapter | UvA-DARE
  • Li, M., Vitanyi, P.M.B. (1997) Reversibility and adiabatic computation: Trading time and space for energy.
    Technical Report quant-ph. onbekend (FdL).
    Report | UvA-DARE
  • Li, M., Vitanyi, P.M.B. (1998) Miao shu fu za xing.
    Ke xue chu ban she.
  • Li, M., Vitanyi, P.M.B. (2002) Algorithmic complexity.
    In Smelser, N.J. Baltes, P.B. (Eds.), International Encyclopedia of the Social & Behavioral Sciences (pp 376-382). Pergamon.
    Chapter | UvA-DARE
  • Li, M., Vitanyi, P.M.B. (2007) Applications of Algorithmic Information Theory.
    Scholarpedia Journal, Vol. 2
  • Li, Ming, Chen, X., Lie, X., Ma, B., Vitanyi, P.M.B. (2003) The similarity metric.
    In Proceedings 14th ACM-SIAM symposium on discrete algorithms (pp 863-872)
    Conference contribution | UvA-DARE
  • Li, Ming, Chen, X., Lie, X., Ma, B., Vitanyi, P.M.B. (2003) Clustering by compression.
    In Proceedings International Symposium on Information Theory (pp 261-261)
    Conference contribution | UvA-DARE
  • Li, Ming, Tromp, J.A.H., Vitanyi, P.M.B. (2003) Sharpening Occam's Razor.
    Information Processing Letters, Vol. 85 (pp 267-274)
  • Li, R., Kaptein, R., Hiemstra, D., Kamps, J. (2008) Exploring topic-based language models for effective web information retrieval.
    In Proceedings of the 8th Dutch-Belgian Information Retrieval Workshop (DIR 2008) (pp 65-71). University of Maastricht.
  • Lin, S., Behnke, G., Bercher, P. (2022) Exploiting Solution Order Graphs and Path Decomposition Trees for More Efficient HTN Plan Verification via SAT Solving.
    In HPLAN 2022 : Proceedings of the 5th Workshop on Hierarchical Planning: 32nd International Conference on Automated Planning and Scheduling : June 13-24, 2022, virtually from Singapore (pp 24-28). ICAPS.
  • Lin, S., Behnke, G., Bercher, P. (2023) Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning.
    In Gal, K. Nowé, A. Nalepa, G.J. Fairstein, R. Rădulescu, R. (Eds.), ECAI 2023: 26th European Conference on Artificial Intelligence, September 30-October 4, 2023, Kraków, Poland, including 12th Conference on Prestigious Applications of Intelligent Systems ( PAIS 2023) : proceedings (pp 1489-1496) (Frontiers in Artificial Intelligence and Applications, Vol. 372). IOS Press.
    Conference contribution | https://doi.org/10.3233/FAIA230428 | UvA-DARE
  • Lin, S., Behnke, G., Ondrčková, S., Barták, R., Bercher, P. (2022) On Total-Order HTN Plan Verification with Method Preconditions: An Extension of the CYK Parsing Algorithm.
    In HPLAN 2022 : Proceedings of the 5th Workshop on Hierarchical Planning: 32nd International Conference on Automated Planning and Scheduling : June 13-24, 2022, virtually from Singapore (pp 52-58). ICAPS.
  • Lin, S., Behnke, G., Ondrčková, S., Barták, R., Bercher, P. (2023) On Total-Order HTN Plan Verification with Method Preconditions: An Extension of the CYK Parsing Algorithm.
    In Williams, B. Chen, Y. Neville, J. (Eds.), Proceedings of the 37th AAAI Conference on Artificial Intelligence: AAAI-2023 : Washington, DC, USA, February 7-14, 2023 (pp 12041–12048). AAAI Press.
  • Lindemann, M., Koller, A., Titov, I. (2023) Compositional Generalization without Trees using Multiset Tagging and Latent Permutations.
    In Rogers, A. Boyd-Graper, J. Okazaki, N. (Eds.), The 61st Conference of the Association for Computational Linguistics: ACL 2023 : Proceedings of the Conference : July 9-14, 2023 (pp 14488-14506). Association for Computational Linguistics.
  • Lindemann, M., Koller, A., Titov, I. (2023) Compositional Generalisation with Structured Reordering and Fertility Layers.
    In Vlachos, A. Augenstein, I. (Eds.), The 17th Conference of the European Chapter of the Association for Computational Linguistics: EACL 2023 : proceedings of the conference : May 2-6, 2023 (pp 2172–2186). Association for Computational Linguistics.
  • Linden, N., de Wolf, R. (2021) Lightweight detection of a small number of large errors in a quantum circuit.
    Quantum, Vol. 5

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