The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory. - Grégory Lafitte; Jacques Mazoyer (MFCS, 2000)

How Powerful Are Infinite Time Machines? - Grégory Lafitte (FCT, 2001)

On Randomness and Infinity. - Grégory Lafitte (IFIP TCS, 2002)

Universal Tilings. - Grégory Lafitte; Michael Weiss (STACS, 2007)

Computability of Tilings. - Grégory Lafitte; Michael Weiss (IFIP TCS, 2008)

Goedel incompleteness revisited. - Grégory Lafitte (JAC, 2008)

A Topological Study of Tilings. - Grégory Lafitte; Michael Weiss (TAMC, 2008)

Busy beavers gone wild - Grégory Lafitte (CSP, 2008)

Constructing New Aperiodic Self-simulating Tile Sets. - Grégory Lafitte; Michael Weiss (CiE, 2009)

An Almost Totally Universal Tile Set. - Grégory Lafitte; Michael Weiss (TAMC, 2009)

Infinite Time Cellular Automata: a Real Computation Model. - Fabien Givors; Grégory Lafitte; Nicolas Ollinger (JAC, 2010)

Tilings: simulation and universality. - Grégory Lafitte; Michael Weiss (Math. Struct. Comput. Sci., 2010)

Sub-computabilities. - Fabien Givors; Grégory Lafitte (FCT, 2011)

Admissibles in Gaps. - Merlin Carl; Bruno Durand 001; Grégory Lafitte; Sabrina Ouazzani (CiE, 2017)

Infinite Time Busy Beavers. - Oscar Defrain; Bruno Durand 001; Grégory Lafitte (CiE, 2017)

On shift-invariant maximal filters and hormonal cellular automata. - Julien Cervelle; Grégory Lafitte (LICS, 2017)

An algorithmic approach to characterizations of admissibles. - Bruno Durand 001; Grégory Lafitte (CiE, 2019)