Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof. - Bruno Durand 001 (FCT, 1993)

Global Properties of 2D Cellular Automata: Some Complexity Results. - Bruno Durand 001 (MFCS, 1993)

Automates cellulaires - reversibilite et complexite. - Bruno Durand 001 (1994)

Growing Patterns in One Dimensional Cellular Automata. - Bruno Durand 001; Jacques Mazoyer (Complex Syst., 1994)

The Surjectivity Problem for 2D Cellular Automata. - Bruno Durand 001 (J. Comput. Syst. Sci., 1994)

Inversion of 2D Cellular Automata: Some Complexity Results. - Bruno Durand 001 (Theor. Comput. Sci., 1994)

Growing Patterns in 1D Cellular Automata. - Bruno Durand 001; Jacques Mazoyer (FCT, 1995)

A Random NP-Complete Problem for Inversion of 2D Cellular Automata. - Bruno Durand 001 (Theor. Comput. Sci., 1995)

Self-Similarity Viewed as a Local Property via Tile Sets. - Bruno Durand 001 (MFCS, 1996)

Deterministic Rational Transducers and Random Sequences. - Sylvain Porrot; Max Dauchet; Bruno Durand 001; Nikolai K. Vereshchagin (FoSSaCS, 1998)

Tilings and Quasiperiodicity. - Bruno Durand 001 (Theor. Comput. Sci., 1999)

On the Complexity of Deadlock Detection in Families of Planar Nets. - Bruno Durand 001; Anne-Cécile Fabret (Theor. Comput. Sci., 1999)

Algorithmic Information Theory and Cellular Automata Dynamics. - Julien Cervelle; Bruno Durand 001; Enrico Formenti (MFCS, 2001)

Kolmogorov complexity and cellular automata classification. - Jean-Christophe Dubacq; Bruno Durand 001; Enrico Formenti (Theor. Comput. Sci., 2001)

Kolmogorov Complexity - Foreword. - Bruno Durand 001 (Theor. Comput. Sci., 2002)

De la logique aux pavages. - Bruno Durand 001 (Theor. Comput. Sci., 2002)

Comparison between the complexity of a function and the complexity of its graph. - Bruno Durand 001; Sylvain Porrot (Theor. Comput. Sci., 2002)

Descriptive complexity of computable sequences. - Bruno Durand 001; Alexander Shen 001; Nikolai K. Vereshchagin (Theor. Comput. Sci., 2002)

Number conserving cellular automata: new results on decidability and dynamics. - Bruno Durand 001; Enrico Formenti; Aristide Grange; Zsuzsanna Róka (DMCS, 2003)

On undecidability of equicontinuity classification for cellular automata. - Bruno Durand 001; Enrico Formenti; Georges Varouchas (DMCS, 2003)

Number-conserving cellular automata I: decidability. - Bruno Durand 001; Enrico Formenti; Zsuzsanna Róka (Theor. Comput. Sci., 2003)

Do stronger definitions of randomness exist? - Bruno Durand 001; Vladimir Kanovei; Vladimir A. Uspensky; Nikolai K. Vereshchagin (Theor. Comput. Sci., 2003)

Ecological Turing Machines. - Bruno Durand 001; Andrei A. Muchnik; Maxim Ushakov; Nikolai K. Vereshchagin (ICALP, 2004)

Kolmogorov-Loveland stochasticity for finite strings. - Bruno Durand 001; Nikolai K. Vereshchagin (Inf. Process. Lett., 2004)

Tilings: recursivity and regularity. - Julien Cervelle; Bruno Durand 001 (Theor. Comput. Sci., 2004)

A new dimension sensitive property for cellular automata. - Vincent Bernardi; Bruno Durand 001; Enrico Formenti; Jarkko Kari (Theor. Comput. Sci., 2005)

Foreword. - Volker Diekert; Bruno Durand 001 (Theory Comput. Syst., 2007)

Preface. - Bruno Durand 001 (JAC, 2008)

Structural aspects of tilings. - Alexis Ballier; Bruno Durand 001; Emmanuel Jeandel (STACS, 2008)

Fixed Point and Aperiodic Tilings. - Bruno Durand 001; Alexander Shen 001; Andrei E. Romashchenko (Electron. Colloquium Comput. Complex., 2008)

Complex tilings. - Bruno Durand 001; Leonid A. Levin; Alexander Shen 001 (J. Symb. Log., 2008)

Asymptotic Cellular Complexity. - Bruno Durand 001; Victor Poupet (Developments in Language Theory, 2009)

High Complexity Tilings with Sparse Errors. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (ICALP (1), 2009)

Fixed Point Theorem and Aperiodic Tilings. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (Bull. EATCS, 2009)

Effective Closed Subshifts in 1D Can Be Implemented in 2D. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (Fields of Logic and Computation, 2010)

1D Effectively Closed Subshifts and 2D Tilings. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (JAC, 2010)

Tilings Robust to Errors. - Alexis Ballier; Bruno Durand 001; Emmanuel Jeandel (LATIN, 2010)

Fixed-point tile sets and their applications. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (J. Comput. Syst. Sci., 2012)

Discrete mathematical structures: From dynamics to complexity. - Cristian Calude; Bruno Durand 001; Anahí Gajardo; Dominique Perrin; Ivan Rapaport; Sergio Rica (Theor. Comput. Sci., 2013)

Quasiperiodicity and Non-computability in Tilings. - Bruno Durand 001; Andrei E. Romashchenko (MFCS (1), 2015)

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 the Expressive Power of Quasiperiodic SFT. - Bruno Durand 001; Andrei E. Romashchenko (MFCS, 2017)

Aperiodic tilings and entropy. - Bruno Durand 001; Guilhem Gamard; Anaël Grandjean (Theor. Comput. Sci., 2017)

The expressiveness of quasiperiodic and minimal shifts of finite type. - Bruno Durand 001; Andrei E. Romashchenko (CoRR, 2018)

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

On the Structure of Ammann A2 Tilings. - Bruno Durand 001; Alexander Shen 001; Nikolai K. Vereshchagin (Discret. Comput. Geom., 2020)