-
Leymann, S., Lentz, T.O., Burgers, C.F. (2022) Prosodic markers of satirical imitation.Humor, Vol. 35 (pp 509-529)Article | https://doi.org/10.1515/humor-2021-0138 | UvA-DARE
-
Leymann, S.I.D., Lentz, T.O., Burgers, C.F. (2020) Identifying Political Satire through Ironic Prosody.Abstract | UvA-DARE
-
Leymann, S.I.D., Lentz, T.O., Burgers, C.F. (2020) Global vs. Local: A New Approach to Analyzing Prosodic Features of Irony.Abstract | UvA-DARE
-
Li, D. (2021) Formal threads in the social fabric: Studies in the logical dynamics of multi-agent interaction.Thesis, fully internal | UvA-DARE
-
Li, Jiaxin, Baker, D.J., Burgoyne, J.A., Honing, H. (2023) Is Pitch Information Indispensable for Music Recognition? A Pilot Study Based on a Musical Matching Pairs Game.In Tsuzaki, M. Sadakata, M. Ikegami, S. Matsui, T. Okano, M. Shoda, H. (Eds.), The e-proceedings of the 17th International Conference on Music Perception and Cognition and the 7th Conference of the Asia-Pacific Society for the Cognitive Sciences of Music (pp 65-71). The Japanese Society for Music Perception and Cognition.Conference contribution | https://jsmpc.org/ICMPC17/news/e-proceedings/ | UvA-DARELi, Jiaxin, Baker, David John, Burgoyne, J.A., Honing, H. (2022) Unravelling Our Capacity for Music: The Potential Role of Memory-Based Games.Paper | UvA-DARELi, Jiaxin, Baker, David John, Burgoyne, J.A., Honing, H. (2022) The Possibilities and Impossibilities of the Matching-Pairs Game for Music Cognition Research — An Evaluation of a Case Study.Paper | UvA-DARELi, L., Titov, I., Sporleder, C. (2014) Improved Estimation of Entropy for Evaluation of Word Sense Induction.Computational Linguistics, Vol. 40 (pp 671-685)Article | https://doi.org/10.1162/COLI_a_00196 | UvA-DARELi, L. (2023) Games, boards and play: A logical perspective.ILLC Dissertation SeriesThesis, fully internal | UvA-DARELi, M., Chen, X., Li, B., Vitanyi, P.M.B. (2004) The similarity metric.IEEE Transactions on Information Theory, Vol. 50 (pp 3250-3264)Article | https://doi.org/10.1109/TIT.2004.838101 | UvA-DARELi, M., Tromp, J., Vitanyi, P.M.B. (1996) How to share concurrent wait-free variables.Journal of the Association for Computing Machinery, Vol. 43 (pp 723-746)Article | https://doi.org/10.1145/234533.234556 | UvA-DARELi, M., Tromp, J., Vitanyi, P.M.B. (1997) Reversible simulation of irreversible computation by pebble games.Technical Report quant-ph. onbekend (FdL).Report | UvA-DARELi, M., Tromp, J., Vitanyi, P.M.B. (2002) Sharpening Occam's Razor.Lecture Notes in Computer Science, Vol. 2387 (pp 411-419)Article | UvA-DARELi, M., Vitányi, P. (2008) An introduction to Kolmogorov complexity and its applications. - 3rd edition.Texts in computer science. Springer.Li, M., Vitanyi, P.M.B. (1994) Statistical properties of finite sequences with high Kolmogorov complexity.Mathematical Systems Theory, Vol. 27 (pp 365-376)Article | https://doi.org/10.1007/BF01192146 | UvA-DARELi, M., Vitanyi, P.M.B. (1994) Kolmogorov complexity arguments in combinatorics.Journal of Combinatorial Theory. Series A, Vol. 66 (pp 226-236)Article | https://doi.org/10.1016/0097-3165(94)90064-7 | UvA-DARELi, M., Vitanyi, P.M.B. (1994) Inductive Reasoning.In Ristad, E.S. (Eds.), {Language Computations; Proc. DIMACS Workshop on Human Language, March 20-22, 1992 (pp 127-148) (DIMACS Series in Discrete Mathematics and Theoretical Compue). American Math. Society.Chapter | UvA-DARELi, M., Vitanyi, P.M.B. (1995) Computational Machine Learning in Theory and Praxis.In Computer Science Today (pp 518-535) (Lecture Notes in Computer Science). Springer Verlag.Chapter | UvA-DARELi, M., Vitanyi, P.M.B. (1995) A new approach to formal language theory by Kolmogorov complexity.SIAM Journal on Computing, Vol. 24 (pp 398-410)Article | https://doi.org/10.1137/S009753979324485X | UvA-DARELi, M., Vitanyi, P.M.B. (1995) Correction to: Kolmogorov complexity arguments in Combinatorics.Journal of Combinatorial Theory. Series A, Vol. 69 (pp 183)Erratum / Corrigendum | 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