Bruno Durand

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78(3): 731-764 (2012)

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Effective Closed Subshifts in 1D Can Be Implemented in 2D. Fields of Logic and Computation 2010: 208-226

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: 1D Effectively Closed Subshifts and 2D Tilings. JAC 2010: 2-7

Alexis Ballier, Bruno Durand, Emmanuel Jeandel: Tilings Robust to Errors. LATIN 2010: 480-491

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed point theorem and aperiodic tilings. CoRR abs/1003.2801 (2010)

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Effective closed subshifts in 1D can be implemented in 2D. CoRR abs/1003.3103 (2010)

Bruno Durand, Alexander Shen, Andrei E. Romashchenko: 1D Effectively Closed Subshifts and 2D Tilings. CoRR abs/1012.1329 (2010)

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed Point Theorem and Aperiodic Tilings. Bulletin of the EATCS 97: 126-136 (2009)

Bruno Durand, Victor Poupet: Asymptotic Cellular Complexity. Developments in Language Theory 2009: 195-206

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

Bruno Durand (Ed.): First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), Uzès, France, April 21-25, 2008. Proceedings. MCCME Publishing House, Moscow 2009, isbn 978-5-94057-377-7

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed-point tile sets and their applications. CoRR abs/0910.2415 (2009)

Bruno Durand, Leonid A. Levin, Alexander Shen: Complex tilings. J. Symb. Log. 73(2): 593-613 (2008)

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed Point and Aperiodic Tilings. Developments in Language Theory 2008: 276-288

Bruno Durand: Preface. JAC 2008

Alexis Ballier, Bruno Durand, Emmanuel Jeandel: Structural aspects of tilings. STACS 2008: 61-72

Bruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed Point and Aperiodic Tilings. CoRR abs/0802.2432 (2008)

Alexis Ballier, Bruno Durand, Emmanuel Jeandel: Structural aspects of tilings. CoRR abs/0802.2828 (2008)

Bruno Durand, Alexander Shen, Andrei E. Romashchenko: Fixed Point and Aperiodic Tilings. Electronic Colloquium on Computational Complexity (ECCC) 15(030) (2008)

Volker Diekert, Bruno Durand: Foreword. Theory Comput. Syst. 40(4): 301 (2007)

Bruno Durand, Wolfgang Thomas (Eds.): STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings. Lecture Notes in Computer Science 3884, Springer 2006, isbn 3-540-32301-5

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)

Volker Diekert, Bruno Durand (Eds.): STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings. Lecture Notes in Computer Science 3404, Springer 2005, isbn 3-540-24998-2

Bruno Durand, Nikolai K. Vereshchagin: Kolmogorov-Loveland stochasticity for finite strings. Inf. Process. Lett. 91(6): 263-269 (2004)

Julien Cervelle, Bruno Durand: Tilings: recursivity and regularity. Theor. Comput. Sci. 310(1-3): 469-477 (2004)

Bruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin: Ecological Turing Machines. ICALP 2004: 457-468

Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari: A New Dimension Sensitive Property for Cellular Automata. MFCS 2004: 416-426

Bruno Durand, Enrico Formenti, Zsuzsanna Róka: Number-conserving cellular automata I: decidability. Theor. Comput. Sci. 1-3(299): 523-535 (2003)

Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin: Do stronger definitions of randomness exist? Theor. Comput. Sci. 290(3): 1987-1996 (2003)

Bruno Durand, Enrico Formenti, Georges Varouchas: On undecidability of equicontinuity classification for cellular automata. DMCS 2003: 117-128

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

Bruno Durand: Kolmogorov Complexity - Foreword. Theor. Comput. Sci. 271(1-2): 1 (2002)

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)

Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin: Descriptive complexity of computable sequences. Theor. Comput. Sci. 271(1-2): 47-58 (2002)

Bruno Durand: De la logique aux pavages. Theor. Comput. Sci. 281(1-2): 311-324 (2002)

Jean-Christophe Dubacq, Bruno Durand, Enrico Formenti: Kolmogorov complexity and cellular automata classification. Theor. Comput. Sci. 259(1-2): 271-285 (2001)

Julien Cervelle, Bruno Durand, Enrico Formenti: Algorithmic Information Theory and Cellular Automata Dynamics. MFCS 2001: 248-259

Bruno Durand, Leonid A. Levin, Alexander Shen: Complex tilings. STOC 2001: 732-739

Bruno Durand, Leonid A. Levin, Alexander Shen: Complex Tilings. CoRR cs.CC/0107008 (2001)

Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin: Descriptive complexity of computable sequences. Electronic Colloquium on Computational Complexity (ECCC)(087) (2001)

Julien Cervelle, Bruno Durand: Tilings: Recursivity and Regularity. STACS 2000: 491-502

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)

Bruno Durand: Tilings and Quasiperiodicity. Theor. Comput. Sci. 221(1-2): 61-75 (1999)

Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin: Descriptive Complexity of Computable Sequences. STACS 1999: 153-162

Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin: Deterministic Rational Transducers and Random Sequences. FoSSaCS 1998: 258-272

Bruno Durand, Sylvain Porrot: Comparison Between the Complexity of a Function and the Complexity of Its Graph. MFCS 1998: 732-739

Bruno Durand: Tilings and Quasiperiodicity. ICALP 1997: 65-75

Bruno Durand: Self-Similarity Viewed as a Local Property via Tile Sets. MFCS 1996: 312-323

Bruno Durand: A Random NP-Complete Problem for Inversion of 2D Cellular Automata. Theor. Comput. Sci. 148(1): 19-32 (1995)

Bruno Durand, Jacques Mazoyer: Growing Patterns in 1D Cellular Automata. FCT 1995: 211-220

Bruno Durand: A Random NP-Complete Problem for Inversion of 2D Cellular Automata. STACS 1995: 95-106

Bruno Durand: Automates cellulaires - reversibilite et complexite. L'Ecole Normale Supérieure Lyon 1994, pp. 1-64

Bruno Durand: The Surjectivity Problem for 2D Cellular Automata. J. Comput. Syst. Sci. 49(3): 718-725 (1994)

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

Bruno Durand: Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof. FCT 1993: 204-211

Bruno Durand: Global Properties of 2D Cellular Automata: Some Complexity Results. MFCS 1993: 433-441