Bruno Durand - RankMe

70 papers A* 3A 6B 10C 6Journal 36Unranked 7

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