M2 IMD Communication Scientifique en Anglais

  1. Non-idempotent intersection types for the λ-Calculus, de A. Bucciarelli, D. Kesner, D. Ventura. Logic Journal of the IGPL, 25(4):431–464, 2017.
  2. Linear λ-terms as invariants of rooted trivalent maps, de N. Zeilberger. Journal of Functional Programming, Volume 26, 2016.
  3. On the translation of languages from left to right, de Donald Knuth (1965).
  4. Assigning meaning to programs, de Robert Floyd (1967).
  5. AUTOMATH, a language for mathematics, de Nicolaas de Bruijn (1968).
  6. On the Triangulation of Regular Loci, de Stewart S. Cairns.
  7. A small aperiodic set of Wang tiles, de Jarkko Kari.
  8. An aperiodic set of 11 Wang tiles, de Emmanuel Jeandel, Michael Rao.
  9. An Algebraic Geometric Approach to Nivat’s Conjecture, de Jarkko Kari, Michal Szabados.
  10. Aperiodic Subshifts of Finite Type on Groups, de Emmanuel Jeandel.
  11. Quantum Finite Automata: A Modern Introduction, de Cem Say, Abuzer Yakaryılmaz (aussi sur http://dx.doi.org/10.1007/978-3-319-13350-8_16).
  12. Complexity of sequences and dynamical systems, de Sébastien Ferenczi.
  13. On Non-Computable Functions, de T. Rado. Bell System Technical Journal, 41: 3. pages 877-884, 1962.
  14. Tiling the Plane with a Fixed Number of Polyominoes, de N. Ollinger. Proceedings of 3rd Conf. on Language and Automata Theory and Applications (LATA) 2009.
  15. Cellular Automata and Powers of p/q, de J. Kari & J. Kopra.
  16. Groups defined by Automata, de L. Bartholdi & P. V. Silva. Handbook of Automata Theory (II.) pages 871-911, 2021.
  17. Decidability of the HD0L ultimate periodicity problem, de Fabien Durand. RAIRO Theoretical Informatics and Applications 47(2): 201-214 (2013).
  18. Cellular automata and Lyapunov exponents, de Pierre Tisseur, 2003.
  19. On the Undecidability of the Tiling Problem, de J. Kari. Proceedings of 34th Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM) 2008.
  20. Periodicity and Immortality in Reversible Computing, de J. Kari & N. Ollinger. Proceedings of 33rd Symposium MFCS 2008.
  21. On time-symmetry in cellular automata, de A. Gajardo, J. Kari, & A. Moreira. Journal of Computer and System Sciences, Volume 78, Issue 4, pages 1115-1126, 2012.
  22. Belenios: a simple private and verifiable electronic voting system, Véronique Cortier, Pierrick Gaudry, Stephane Glondu.
  23. Exploring Unknown Undirected Graphs, Petrişor Panaite and Andrzej Pelc (1997).
  24. Balanced Allocations, Y. Azar et al. (1994).
  25. Cooperative mobile guards in grids, A. Kosowski et al. (2007).
  26. On the cancellation law among finite relational structures, L. Lovász (1971).
  27. Probabilistic Operational Semantics for the Lambda Calculus, Ugo Dal Lago and Margherita Zorzi (2012).
  28. Automatic verification of multi-agent systems in parameterised grid-environments, B. Aminof et al. (2016).
  29. The theory of timed automata, R. Alur, D. Dill.
  30. Alternating tree automata, parity games, and modal mu-calculus, T. Wilke.
  31. Quantitative languages, K. Chatterjee et al. (2010).
  32. On the Space Complexity of Randomized Synchronization, F. Fich et al. (1998).
  33. Notions of Computation and Monads, E. Moggi (1991).
  34. The duality of computation, P-L Curien, H. Herbelin (2012).
  35. First steps in game semantics, P. Clairambault (2024).
  36. On the logical structure of choice and bar induction principles, N. Brede, H. Herbelin (2021).
  37. Paperfolding morphisms, planefilling curves, and fractal tiles, M. Dekking (2010).
  38. Infinite games on finitely coloured graphs with applications to automata on infinite trees, W. Zielonka (1998).
  39. Infinite games played on finite graphs, R. McNaughton (2002).
  40. Snake in optimal space and time, P. Bille et al. (2024).
  41. Achieving the highest possible Elo rating, R. Shah (2024).
  42. Tetris with few piece types, E.D. Demaine et al. (2024).
  43. The lesson of causal discovery algorithms for quantum correlations: causal explanations of Bell-inequality violations require fine-tuning, C.J. Wood, R.W. Spekkens (2015).
  44. Playing Snake on a Graph, D. Graafsma et al. (2025).
  45. Reconstructing Graphs from Connected Triples, P. Bastide et al. (2023).
  46. Maker-Maker and Maker-Breaker games are PSPACE-complete, J.M. Byskov (2004).
  47. Coin-moving puzzles, E.D. Demaine et al. (2002).
  48. Linear lambda calculus and PTIME-completeness, H.G. Mairson (2004).
  49. Simply typed convertibility is TOWER-complete even for safe lambda-terms, Lê Thành Dũng Nguyên (2024).