 | 2011 |
|---|
| 14 |       | Fabien Givors,
Grégory Lafitte:
Sub-computabilities.
FCT 2011: 322-335 |
| 2010 |
|---|
| 13 | | Fabien Givors,
Grégory Lafitte,
Nicolas Ollinger:
Infinite Time Cellular Automata: a Real Computation Model.
JAC 2010: 111-120 |
| 12 | | Fabien Givors,
Grégory Lafitte,
Nicolas Ollinger:
Infinite Time Cellular Automata: A Real Computation Model
CoRR abs/1012.1221: (2010) |
| 11 | | Grégory Lafitte,
Michael Weiss:
Tilings: simulation and universality.
Mathematical Structures in Computer Science 20(5): 813-850 (2010) |
| 2009 |
|---|
| 10 | | Grégory Lafitte,
Michael Weiss:
Constructing New Aperiodic Self-simulating Tile Sets.
CiE 2009: 300-309 |
| 9 | | Grégory Lafitte,
Michael Weiss:
An Almost Totally Universal Tile Set.
TAMC 2009: 271-280 |
| 2008 |
|---|
| 8 | | Grégory Lafitte:
Busy beavers gone wild
CSP 2008: 123-129 |
| 7 | | Grégory Lafitte,
Michael Weiss:
Computability of Tilings.
IFIP TCS 2008: 187-201 |
| 6 |  | Grégory Lafitte:
Goedel incompleteness revisited.
JAC 2008: 74-89 |
| 5 | | Grégory Lafitte,
Michael Weiss:
A Topological Study of Tilings.
TAMC 2008: 375-387 |
| 2007 |
|---|
| 4 | | Grégory Lafitte,
Michael Weiss:
Universal Tilings.
STACS 2007: 367-380 |
| 2002 |
|---|
| 3 | | Grégory Lafitte:
On Randomness and Infinity.
IFIP TCS 2002: 267-279 |
| 2001 |
|---|
| 2 | | Grégory Lafitte:
How Powerful Are Infinite Time Machines?
FCT 2001: 252-263 |
| 2000 |
|---|
| 1 | | Grégory Lafitte,
Jacques Mazoyer:
The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory.
MFCS 2000: 508-517 |
Data released under the ODC-BY 1.0 license — See also our legal information page