( en | de | ru )

 

Disambiguation of "Lafitte, Grégory"

Author of the publication

copydeleteadd this publication to your clipboard
An algorithmic approach to characterizations of admissibles.

, and . CiE, volume 11558 of Lecture Notes in Computer Science, page 181-192. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Grégory Nain

Grégory Païs

Grégory Mallet

Grégory Smits

Grégory Batt

 

Other publications of authors with the same name

The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory., and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 508-517. Springer, (2000)On Randomness and Infinity.. IFIP TCS, volume 223 of IFIP Conference Proceedings, page 267-279. Kluwer, (2002)A Topological Study of Tilings., and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 375-387. Springer, (2008)How Powerful Are Infinite Time Machines?. FCT, volume 2138 of Lecture Notes in Computer Science, page 252-263. Springer, (2001)Computability of Tilings., and . IFIP TCS, volume 273 of IFIP, page 187-201. Springer, (2008)Tilings: simulation and universality., and . Math. Struct. Comput. Sci., 20 (5): 813-850 (2010)An algorithmic approach to characterizations of admissibles., and . CiE, volume 11558 of Lecture Notes in Computer Science, page 181-192. Springer, (2019)Universal Tilings., and . STACS, volume 4393 of Lecture Notes in Computer Science, page 367-380. Springer, (2007)Constructing New Aperiodic Self-simulating Tile Sets., and . CiE, volume 5635 of Lecture Notes in Computer Science, page 300-309. Springer, (2009)An Almost Totally Universal Tile Set., and . TAMC, volume 5532 of Lecture Notes in Computer Science, page 271-280. Springer, (2009)