| 2009 |
|---|
| 43 | | Bruno Durand:
First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), Uzès, France, April 21-25, 2008. Proceedings
MCCME Publishing House, Moscow 2009 |
| 2008 |
|---|
| 42 | EE | Bruno Durand,
Andrei E. Romashchenko,
Alexander Shen:
Fixed Point and Aperiodic Tilings.
Developments in Language Theory 2008: 276-288 |
| 41 | | Bruno Durand:
Preface.
JAC 2008 |
| 40 | EE | Alexis Ballier,
Bruno Durand,
Emmanuel Jeandel:
Structural aspects of tilings.
STACS 2008: 61-72 |
| 39 | EE | Bruno Durand,
Andrei E. Romashchenko,
Alexander Shen:
Fixed Point and Aperiodic Tilings
CoRR abs/0802.2432: (2008) |
| 38 | EE | Alexis Ballier,
Bruno Durand,
Emmanuel Jeandel:
Structural aspects of tilings
CoRR abs/0802.2828: (2008) |
| 37 | EE | Bruno Durand,
Alexander Shen,
Andrei E. Romashchenko:
Fixed Point and Aperiodic Tilings.
Electronic Colloquium on Computational Complexity (ECCC) 15(030): (2008) |
| 2007 |
|---|
| 36 | EE | Volker Diekert,
Bruno Durand:
Foreword.
Theory Comput. Syst. 40(4): 301 (2007) |
| 2006 |
|---|
| 35 | | Bruno Durand,
Wolfgang Thomas:
STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings
Springer 2006 |
| 2005 |
|---|
| 34 | | Volker Diekert,
Bruno Durand:
STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings
Springer 2005 |
| 33 | EE | Vincent Bernardi,
Bruno Durand,
Enrico Formenti,
Jarkko Kari:
A new dimension sensitive property for cellular automata.
Theor. Comput. Sci. 345(2-3): 235-247 (2005) |
| 2004 |
|---|
| 32 | EE | Bruno Durand,
Andrei A. Muchnik,
Maxim Ushakov,
Nikolai K. Vereshchagin:
Ecological Turing Machines.
ICALP 2004: 457-468 |
| 31 | EE | Vincent Bernardi,
Bruno Durand,
Enrico Formenti,
Jarkko Kari:
A New Dimension Sensitive Property for Cellular Automata.
MFCS 2004: 416-426 |
| 30 | EE | Bruno Durand,
Nikolai K. Vereshchagin:
Kolmogorov-Loveland stochasticity for finite strings.
Inf. Process. Lett. 91(6): 263-269 (2004) |
| 29 | EE | Julien Cervelle,
Bruno Durand:
Tilings: recursivity and regularity.
Theor. Comput. Sci. 310(1-3): 469-477 (2004) |
| 2003 |
|---|
| 28 | EE | Bruno Durand,
Enrico Formenti,
Georges Varouchas:
On undecidability of equicontinuity classification for cellular automata.
DMCS 2003: 117-128 |
| 27 | EE | Bruno Durand,
Enrico Formenti,
Aristide Grange,
Zsuzsanna Róka:
Number conserving cellular automata: new results on decidability and dynamics.
DMCS 2003: 129-140 |
| 26 | EE | Bruno Durand,
Enrico Formenti,
Zsuzsanna Róka:
Number-conserving cellular automata I: decidability.
Theor. Comput. Sci. 1-3(299): 523-535 (2003) |
| 25 | | Bruno Durand,
Vladimir Kanovei,
Vladimir A. Uspensky,
Nikolai K. Vereshchagin:
Do stronger definitions of randomness exist?
Theor. Comput. Sci. 290(3): 1987-1996 (2003) |
| 2002 |
|---|
| 24 | EE | Bruno Durand:
Kolmogorov Complexity - Foreword.
Theor. Comput. Sci. 271(1-2): 1 (2002) |
| 23 | EE | Bruno Durand,
Sylvain Porrot:
Comparison between the complexity of a function and the complexity of its graph.
Theor. Comput. Sci. 271(1-2): 37-46 (2002) |
| 22 | EE | Bruno Durand,
Alexander Shen,
Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences.
Theor. Comput. Sci. 271(1-2): 47-58 (2002) |
| 21 | EE | Bruno Durand:
De la logique aux pavages.
Theor. Comput. Sci. 281(1-2): 311-324 (2002) |
| 2001 |
|---|
| 20 | EE | Julien Cervelle,
Bruno Durand,
Enrico Formenti:
Algorithmic Information Theory and Cellular Automata Dynamics.
MFCS 2001: 248-259 |
| 19 | EE | Bruno Durand,
Leonid A. Levin,
Alexander Shen:
Complex tilings.
STOC 2001: 732-739 |
| 18 | EE | Bruno Durand,
Leonid A. Levin,
Alexander Shen:
Complex Tilings
CoRR cs.CC/0107008: (2001) |
| 17 | EE | Bruno Durand,
Alexander Shen,
Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences
Electronic Colloquium on Computational Complexity (ECCC)(087): (2001) |
| 16 | EE | Jean-Christophe Dubacq,
Bruno Durand,
Enrico Formenti:
Kolmogorov complexity and cellular automata classification.
Theor. Comput. Sci. 259(1-2): 271-285 (2001) |
| 2000 |
|---|
| 15 | EE | Julien Cervelle,
Bruno Durand:
Tilings: Recursivity and Regularity.
STACS 2000: 491-502 |
| 1999 |
|---|
| 14 | EE | Bruno Durand,
Alexander Shen,
Nikolai K. Vereshchagin:
Descriptive Complexity of Computable Sequences.
STACS 1999: 153-162 |
| 13 | EE | Bruno Durand,
Anne-Cécile Fabret:
On the Complexity of Deadlock Detection in Families of Planar Nets.
Theor. Comput. Sci. 215(1-2): 225-237 (1999) |
| 12 | EE | Bruno Durand:
Tilings and Quasiperiodicity.
Theor. Comput. Sci. 221(1-2): 61-75 (1999) |
| 1998 |
|---|
| 11 | EE | Sylvain Porrot,
Max Dauchet,
Bruno Durand,
Nikolai K. Vereshchagin:
Deterministic Rational Transducers and Random Sequences.
FoSSaCS 1998: 258-272 |
| 10 | EE | Bruno Durand,
Sylvain Porrot:
Comparison Between the Complexity of a Function and the Complexity of Its Graph.
MFCS 1998: 732-739 |
| 1997 |
|---|
| 9 | | Bruno Durand:
Tilings and Quasiperiodicity.
ICALP 1997: 65-75 |
| 1996 |
|---|
| 8 | | Bruno Durand:
Self-Similarity Viewed as a Local Property via Tile Sets.
MFCS 1996: 312-323 |
| 1995 |
|---|
| 7 | | Bruno Durand,
Jacques Mazoyer:
Growing Patterns in 1D Cellular Automata.
FCT 1995: 211-220 |
| 6 | | Bruno Durand:
A Random NP-Complete Problem for Inversion of 2D Cellular Automata.
STACS 1995: 95-106 |
| 5 | EE | Bruno Durand:
A Random NP-Complete Problem for Inversion of 2D Cellular Automata.
Theor. Comput. Sci. 148(1): 19-32 (1995) |
| 1994 |
|---|
| 4 | | Bruno Durand:
The Surjectivity Problem for 2D Cellular Automata.
J. Comput. Syst. Sci. 49(3): 718-725 (1994) |
| 3 | | Bruno Durand:
Inversion of 2D Cellular Automata: Some Complexity Results.
Theor. Comput. Sci. 134(2): 387-401 (1994) |
| 1993 |
|---|
| 2 | | Bruno Durand:
Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof.
FCT 1993: 204-211 |
| 1 | | Bruno Durand:
Global Properties of 2D Cellular Automata: Some Complexity Results.
MFCS 1993: 433-441 |
