Bruno Durand

Publication Activity (10 Years)

Years Active: 1993-2020
Publications (10 Years): 8

Top Topics

Discrete Geometry

Closure Properties

Conditional Entropy

Expressive Power

Top Venues

Theor. Comput. Sci.

Developments in Language Theory

Publications

Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
On the Structure of Ammann A2 Tilings. Discret. Comput. Geom. 63 (3) (2020)
Bruno Durand, Grégory Lafitte
An algorithmic approach to characterizations of admissibles. CiE (2019)
Bruno Durand, Andrei E. Romashchenko
The expressiveness of quasiperiodic and minimal shifts of finite type. CoRR (2018)
Oscar Defrain, Bruno Durand, Grégory Lafitte
Infinite Time Busy Beavers. CiE (2017)
Merlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani
Admissibles in Gaps. CiE (2017)
Bruno Durand, Andrei E. Romashchenko
On the expressive power of quasiperiodic SFT. CoRR (2017)
Bruno Durand, Andrei E. Romashchenko
On the Expressive Power of Quasiperiodic SFT. MFCS (2017)
Bruno Durand, Guilhem Gamard, Anaël Grandjean
Aperiodic tilings and entropy. Theor. Comput. Sci. 666 (2017)
Bruno Durand, Andrei E. Romashchenko
Quasiperiodicity and Non-computability in Tilings. MFCS (1) (2015)
Bruno Durand, Andrei E. Romashchenko
Quasiperiodicity and non-computability in tilings. CoRR (2015)
Bruno Durand, Guilhem Gamard, Anaël Grandjean
Aperiodic Tilings and Entropy. Developments in Language Theory (2014)
Bruno Durand, Guilhem Gamard, Anaël Grandjean
Aperiodic tilings and entropy. CoRR (2013)
Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica
Discrete mathematical structures: From dynamics to complexity. Theor. Comput. Sci. 504 (2013)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78 (3) (2012)
Bruno Durand, Alexander Shen, Andrei E. Romashchenko
1D Effectively Closed Subshifts and 2D Tilings CoRR (2010)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
Fixed point theorem and aperiodic tilings CoRR (2010)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
Effective Closed Subshifts in 1D Can Be Implemented in 2D. Fields of Logic and Computation (2010)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
1D Effectively Closed Subshifts and 2D Tilings. JAC (2010)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
Effective closed subshifts in 1D can be implemented in 2D CoRR (2010)
Alexis Ballier, Bruno Durand, Emmanuel Jeandel
Tilings Robust to Errors. LATIN (2010)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
Fixed Point Theorem and Aperiodic Tilings. Bull. EATCS 97 (2009)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
High Complexity Tilings with Sparse Errors. ICALP (1) (2009)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
Fixed-point tile sets and their applications CoRR (2009)
Bruno Durand, Victor Poupet
Asymptotic Cellular Complexity. Developments in Language Theory (2009)
Alexis Ballier, Bruno Durand, Emmanuel Jeandel
Structural aspects of tilings. STACS (2008)
Bruno Durand, Alexander Shen, Andrei E. Romashchenko
Fixed Point and Aperiodic Tilings. Electron. Colloquium Comput. Complex. 15 (030) (2008)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
Fixed Point and Aperiodic Tilings. Developments in Language Theory (2008)
Bruno Durand, Andrei E. Romashchenko, Alexander Shen
Fixed Point and Aperiodic Tilings CoRR (2008)
Bruno Durand, Leonid A. Levin, Alexander Shen
Complex tilings. J. Symb. Log. 73 (2) (2008)
Alexis Ballier, Bruno Durand, Emmanuel Jeandel
Structural aspects of tilings CoRR (2008)
Bruno Durand
Preface. JAC (2008)
Volker Diekert, Bruno Durand
Foreword. Theory Comput. Syst. 40 (4) (2007)
Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari
A new dimension sensitive property for cellular automata. Theor. Comput. Sci. 345 (2-3) (2005)
Bruno Durand, Nikolai K. Vereshchagin
Kolmogorov-Loveland stochasticity for finite strings. Inf. Process. Lett. 91 (6) (2004)
Bruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin
Ecological Turing Machines. ICALP (2004)
Julien Cervelle, Bruno Durand
Tilings: recursivity and regularity. Theor. Comput. Sci. 310 (1-3) (2004)
Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari
A New Dimension Sensitive Property for Cellular Automata. MFCS (2004)
Bruno Durand, Enrico Formenti, Georges Varouchas
On undecidability of equicontinuity classification for cellular automata. DMCS (2003)
Bruno Durand, Enrico Formenti, Aristide Grange, Zsuzsanna Róka
Number conserving cellular automata: new results on decidability and dynamics. DMCS (2003)
Bruno Durand, Enrico Formenti, Zsuzsanna Róka
Number-conserving cellular automata I: decidability. Theor. Comput. Sci. 299 (1-3) (2003)
Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin
Do stronger definitions of randomness exist? Theor. Comput. Sci. 290 (3) (2003)
Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
Descriptive complexity of computable sequences. Theor. Comput. Sci. 271 (1-2) (2002)
Bruno Durand
Kolmogorov Complexity - Foreword. Theor. Comput. Sci. 271 (1-2) (2002)
Bruno Durand
De la logique aux pavages. Theor. Comput. Sci. 281 (1-2) (2002)
Bruno Durand, Sylvain Porrot
Comparison between the complexity of a function and the complexity of its graph. Theor. Comput. Sci. 271 (1-2) (2002)
Bruno Durand, Leonid A. Levin, Alexander Shen
Complex Tilings CoRR (2001)
Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
Descriptive complexity of computable sequences Electron. Colloquium Comput. Complex. (087) (2001)
Bruno Durand, Leonid A. Levin, Alexander Shen
Complex tilings. STOC (2001)
Julien Cervelle, Bruno Durand, Enrico Formenti
Algorithmic Information Theory and Cellular Automata Dynamics. MFCS (2001)
Jean-Christophe Dubacq, Bruno Durand, Enrico Formenti
Kolmogorov complexity and cellular automata classification. Theor. Comput. Sci. 259 (1-2) (2001)
Julien Cervelle, Bruno Durand
Tilings: Recursivity and Regularity. STACS (2000)
Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
Descriptive Complexity of Computable Sequences. STACS (1999)
Bruno Durand, Anne-Cécile Fabret
On the Complexity of Deadlock Detection in Families of Planar Nets. Theor. Comput. Sci. 215 (1-2) (1999)
Bruno Durand
Tilings and Quasiperiodicity. Theor. Comput. Sci. 221 (1-2) (1999)
Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin
Deterministic Rational Transducers and Random Sequences. FoSSaCS (1998)
Bruno Durand, Sylvain Porrot
Comparison Between the Complexity of a Function and the Complexity of Its Graph. MFCS (1998)
Bruno Durand
Tilings and Quasiperiodicity. ICALP (1997)
Bruno Durand
Self-Similarity Viewed as a Local Property via Tile Sets. MFCS (1996)
Bruno Durand
A Random NP-Complete Problem for Inversion of 2D Cellular Automata. Theor. Comput. Sci. 148 (1) (1995)
Bruno Durand
A Random NP-Complete Problem for Inversion of 2D Cellular Automata. STACS (1995)
Bruno Durand, Jacques Mazoyer
Growing Patterns in 1D Cellular Automata. FCT (1995)
Bruno Durand, Jacques Mazoyer
Growing Patterns in One Dimensional Cellular Automata. Complex Syst. 8 (6) (1994)
Bruno Durand
Inversion of 2D Cellular Automata: Some Complexity Results. Theor. Comput. Sci. 134 (2) (1994)
Bruno Durand
The Surjectivity Problem for 2D Cellular Automata. J. Comput. Syst. Sci. 49 (3) (1994)
Bruno Durand
Global Properties of 2D Cellular Automata: Some Complexity Results. MFCS (1993)
Bruno Durand
Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof. FCT (1993)