default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Durand 0001
Person information
- affiliation: University of Montpellier, LIRMM, France
- affiliation (former): University of Provence, LIF, Marseille, France
- affiliation (former): ENS de Lyon, LIP, France
Other persons with the same name
- Bruno Durand 0002 — Renault S.A.S, Guyancourt, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j23]Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
:
On the Structure of Ammann A2 Tilings. Discret. Comput. Geom. 63(3): 577-606 (2020)
2010 – 2019
- 2019
- [c30]Bruno Durand, Grégory Lafitte:
An algorithmic approach to characterizations of admissibles. CiE 2019: 181-192 - 2018
- [i13]Bruno Durand, Andrei E. Romashchenko:
The expressiveness of quasiperiodic and minimal shifts of finite type. CoRR abs/1802.01461 (2018) - 2017
- [j22]Bruno Durand, Guilhem Gamard, Anaël Grandjean:
Aperiodic tilings and entropy. Theor. Comput. Sci. 666: 36-47 (2017) - [c29]Merlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani:
Admissibles in Gaps. CiE 2017: 175-186 - [c28]Oscar Defrain, Bruno Durand, Grégory Lafitte:
Infinite Time Busy Beavers. CiE 2017: 221-233 - [c27]Bruno Durand, Andrei E. Romashchenko:
On the Expressive Power of Quasiperiodic SFT. MFCS 2017: 5:1-5:14 - [i12]Bruno Durand, Andrei E. Romashchenko:
On the expressive power of quasiperiodic SFT. CoRR abs/1705.01876 (2017) - 2015
- [c26]Bruno Durand, Andrei E. Romashchenko:
Quasiperiodicity and Non-computability in Tilings. MFCS (1) 2015: 218-230 - [i11]Bruno Durand, Andrei E. Romashchenko:
Quasiperiodicity and non-computability in tilings. CoRR abs/1504.06130 (2015) - 2014
- [c25]Bruno Durand, Guilhem Gamard, Anaël Grandjean:
Aperiodic Tilings and Entropy. Developments in Language Theory 2014: 166-177 - 2013
- [j21]Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica:
Discrete mathematical structures: From dynamics to complexity. Theor. Comput. Sci. 504: 3-4 (2013) - [i10]Bruno Durand, Guilhem Gamard, Anaël Grandjean:
Aperiodic tilings and entropy. CoRR abs/1312.4126 (2013) - 2012
- [j20]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78(3): 731-764 (2012) - 2010
- [c24]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 - [c23]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
1D Effectively Closed Subshifts and 2D Tilings. JAC 2010: 2-7 - [c22]Alexis Ballier, Bruno Durand, Emmanuel Jeandel:
Tilings Robust to Errors. LATIN 2010: 480-491 - [i9]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed point theorem and aperiodic tilings. CoRR abs/1003.2801 (2010) - [i8]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Effective closed subshifts in 1D can be implemented in 2D. CoRR abs/1003.3103 (2010) - [i7]Bruno Durand, Alexander Shen, Andrei E. Romashchenko:
1D Effectively Closed Subshifts and 2D Tilings. CoRR abs/1012.1329 (2010)
2000 – 2009
- 2009
- [j19]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point Theorem and Aperiodic Tilings. Bull. EATCS 97: 126-136 (2009) - [c21]Bruno Durand, Victor Poupet:
Asymptotic Cellular Complexity. Developments in Language Theory 2009: 195-206 - [c20]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
High Complexity Tilings with Sparse Errors. ICALP (1) 2009: 403-414 - [e3]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, ISBN 978-5-94057-377-7 [contents] - [i6]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed-point tile sets and their applications. CoRR abs/0910.2415 (2009) - 2008
- [j18]Bruno Durand, Leonid A. Levin, Alexander Shen:
Complex tilings. J. Symb. Log. 73(2): 593-613 (2008) - [c19]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point and Aperiodic Tilings. Developments in Language Theory 2008: 276-288 - [c18]Bruno Durand:
Preface. JAC 2008 - [c17]Alexis Ballier, Bruno Durand, Emmanuel Jeandel:
Structural aspects of tilings. STACS 2008: 61-72 - [i5]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point and Aperiodic Tilings. CoRR abs/0802.2432 (2008) - [i4]Alexis Ballier, Bruno Durand, Emmanuel Jeandel:
Structural aspects of tilings. CoRR abs/0802.2828 (2008) - [i3]Bruno Durand, Alexander Shen, Andrei E. Romashchenko:
Fixed Point and Aperiodic Tilings. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j17]Volker Diekert, Bruno Durand:
Foreword. Theory Comput. Syst. 40(4): 301 (2007) - 2006
- [e2]Bruno Durand, Wolfgang Thomas:
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 978-3-540-32301-3 [contents] - 2005
- [j16]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) - [e1]Volker Diekert, Bruno Durand:
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 [contents] - 2004
- [j15]Bruno Durand, Nikolai K. Vereshchagin:
Kolmogorov-Loveland stochasticity for finite strings. Inf. Process. Lett. 91(6): 263-269 (2004) - [j14]Julien Cervelle, Bruno Durand:
Tilings: recursivity and regularity. Theor. Comput. Sci. 310(1-3): 469-477 (2004) - [c16]Bruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin:
Ecological Turing Machines. ICALP 2004: 457-468 - [c15]Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari:
A New Dimension Sensitive Property for Cellular Automata. MFCS 2004: 416-426 - 2003
- [j13]Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin:
Do stronger definitions of randomness exist? Theor. Comput. Sci. 290(3): 1987-1996 (2003) - [j12]Bruno Durand, Enrico Formenti, Zsuzsanna Róka:
Number-conserving cellular automata I: decidability. Theor. Comput. Sci. 299(1-3): 523-535 (2003) - [c14]Bruno Durand, Enrico Formenti, Georges Varouchas:
On undecidability of equicontinuity classification for cellular automata. DMCS 2003: 117-128 - [c13]Bruno Durand, Enrico Formenti, Aristide Grange, Zsuzsanna Róka:
Number conserving cellular automata: new results on decidability and dynamics. DMCS 2003: 129-140 - 2002
- [j11]Bruno Durand:
Kolmogorov Complexity - Foreword. Theor. Comput. Sci. 271(1-2): 1 (2002) - [j10]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) - [j9]Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences. Theor. Comput. Sci. 271(1-2): 47-58 (2002) - [j8]Bruno Durand:
De la logique aux pavages. Theor. Comput. Sci. 281(1-2): 311-324 (2002) - 2001
- [j7]Jean-Christophe Dubacq, Bruno Durand, Enrico Formenti:
Kolmogorov complexity and cellular automata classification. Theor. Comput. Sci. 259(1-2): 271-285 (2001) - [c12]Julien Cervelle, Bruno Durand, Enrico Formenti:
Algorithmic Information Theory and Cellular Automata Dynamics. MFCS 2001: 248-259 - [c11]Bruno Durand, Leonid A. Levin, Alexander Shen:
Complex tilings. STOC 2001: 732-739 - [i2]Bruno Durand, Leonid A. Levin, Alexander Shen:
Complex Tilings. CoRR cs.CC/0107008 (2001) - [i1]Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c10]Julien Cervelle, Bruno Durand:
Tilings: Recursivity and Regularity. STACS 2000: 491-502
1990 – 1999
- 1999
- [j6]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) - [j5]Bruno Durand:
Tilings and Quasiperiodicity. Theor. Comput. Sci. 221(1-2): 61-75 (1999) - [c9]Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
Descriptive Complexity of Computable Sequences. STACS 1999: 153-162 - 1998
- [c8]Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin:
Deterministic Rational Transducers and Random Sequences. FoSSaCS 1998: 258-272 - [c7]Bruno Durand, Sylvain Porrot:
Comparison Between the Complexity of a Function and the Complexity of Its Graph. MFCS 1998: 732-739 - 1997
- [c6]Bruno Durand:
Tilings and Quasiperiodicity. ICALP 1997: 65-75 - 1996
- [c5]Bruno Durand:
Self-Similarity Viewed as a Local Property via Tile Sets. MFCS 1996: 312-323 - 1995
- [j4]Bruno Durand:
A Random NP-Complete Problem for Inversion of 2D Cellular Automata. Theor. Comput. Sci. 148(1): 19-32 (1995) - [c4]Bruno Durand, Jacques Mazoyer:
Growing Patterns in 1D Cellular Automata. FCT 1995: 211-220 - [c3]Bruno Durand:
A Random NP-Complete Problem for Inversion of 2D Cellular Automata. STACS 1995: 95-106 - 1994
- [b1]Bruno Durand:
Automates cellulaires - reversibilite et complexite. L'Ecole Normale Supérieure Lyon, 1994, pp. 1-64 - [j3]Bruno Durand, Jacques Mazoyer:
Growing Patterns in One Dimensional Cellular Automata. Complex Syst. 8(6) (1994) - [j2]Bruno Durand:
The Surjectivity Problem for 2D Cellular Automata. J. Comput. Syst. Sci. 49(3): 718-725 (1994) - [j1]Bruno Durand:
Inversion of 2D Cellular Automata: Some Complexity Results. Theor. Comput. Sci. 134(2): 387-401 (1994) - 1993
- [c2]Bruno Durand:
Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof. FCT 1993: 204-211 - [c1]Bruno Durand:
Global Properties of 2D Cellular Automata: Some Complexity Results. MFCS 1993: 433-441
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
