dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Bruno Durand Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78(3): 731-764 (2012)
2010
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: Effective Closed Subshifts in 1D Can Be Implemented in 2D. Fields of Logic and Computation 2010: 208-226
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: 1D Effectively Closed Subshifts and 2D Tilings. JAC 2010: 2-7
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexis Ballier, Bruno Durand, Emmanuel Jeandel: Tilings Robust to Errors. LATIN 2010: 480-491
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed point theorem and aperiodic tilings CoRR abs/1003.2801: (2010)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: Effective closed subshifts in 1D can be implemented in 2D CoRR abs/1003.3103: (2010)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Alexander Shen, Andrei E. Romashchenko: 1D Effectively Closed Subshifts and 2D Tilings CoRR abs/1012.1329: (2010)
2009
49no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno 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
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Victor Poupet: Asymptotic Cellular Complexity. Developments in Language Theory 2009: 195-206
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: High Complexity Tilings with Sparse Errors. ICALP (1) 2009: 403-414
46no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed Point Theorem and Aperiodic Tilings. Bulletin of the EATCS 97: 126-136 (2009)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed-point tile sets and their applications CoRR abs/0910.2415: (2009)
2008
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed Point and Aperiodic Tilings. Developments in Language Theory 2008: 276-288
43no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Preface. JAC 2008
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexis Ballier, Bruno Durand, Emmanuel Jeandel: Structural aspects of tilings. STACS 2008: 61-72
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei E. Romashchenko, Alexander Shen: Fixed Point and Aperiodic Tilings CoRR abs/0802.2432: (2008)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexis Ballier, Bruno Durand, Emmanuel Jeandel: Structural aspects of tilings CoRR abs/0802.2828: (2008)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Alexander Shen, Andrei E. Romashchenko: Fixed Point and Aperiodic Tilings. Electronic Colloquium on Computational Complexity (ECCC) 15(030): (2008)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Leonid A. Levin, Alexander Shen: Complex tilings. J. Symb. Log. 73(2): 593-613 (2008)
2007
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVolker Diekert, Bruno Durand: Foreword. Theory Comput. Syst. 40(4): 301 (2007)
2006
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Wolfgang Thomas: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings Springer 2006
2005
35no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVolker Diekert, Bruno Durand: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings Springer 2005
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari: A new dimension sensitive property for cellular automata. Theor. Comput. Sci. 345(2-3): 235-247 (2005)
2004
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin: Ecological Turing Machines. ICALP 2004: 457-468
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari: A New Dimension Sensitive Property for Cellular Automata. MFCS 2004: 416-426
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Nikolai K. Vereshchagin: Kolmogorov-Loveland stochasticity for finite strings. Inf. Process. Lett. 91(6): 263-269 (2004)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulien Cervelle, Bruno Durand: Tilings: recursivity and regularity. Theor. Comput. Sci. 310(1-3): 469-477 (2004)
2003
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Enrico Formenti, Georges Varouchas: On undecidability of equicontinuity classification for cellular automata. DMCS 2003: 117-128
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Enrico Formenti, Aristide Grange, Zsuzsanna Róka: Number conserving cellular automata: new results on decidability and dynamics. DMCS 2003: 129-140
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Enrico Formenti, Zsuzsanna Róka: Number-conserving cellular automata I: decidability. Theor. Comput. Sci. 1-3(299): 523-535 (2003)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin: Do stronger definitions of randomness exist? Theor. Comput. Sci. 290(3): 1987-1996 (2003)
2002
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Kolmogorov Complexity - Foreword. Theor. Comput. Sci. 271(1-2): 1 (2002)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno 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)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Alexander Shen, Nikolai K. Vereshchagin: Descriptive complexity of computable sequences. Theor. Comput. Sci. 271(1-2): 47-58 (2002)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: De la logique aux pavages. Theor. Comput. Sci. 281(1-2): 311-324 (2002)
2001
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulien Cervelle, Bruno Durand, Enrico Formenti: Algorithmic Information Theory and Cellular Automata Dynamics. MFCS 2001: 248-259
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Leonid A. Levin, Alexander Shen: Complex tilings. STOC 2001: 732-739
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Leonid A. Levin, Alexander Shen: Complex Tilings CoRR cs.CC/0107008: (2001)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Alexander Shen, Nikolai K. Vereshchagin: Descriptive complexity of computable sequences Electronic Colloquium on Computational Complexity (ECCC)(087): (2001)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-Christophe Dubacq, Bruno Durand, Enrico Formenti: Kolmogorov complexity and cellular automata classification. Theor. Comput. Sci. 259(1-2): 271-285 (2001)
2000
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulien Cervelle, Bruno Durand: Tilings: Recursivity and Regularity. STACS 2000: 491-502
1999
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Alexander Shen, Nikolai K. Vereshchagin: Descriptive Complexity of Computable Sequences. STACS 1999: 153-162
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno 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)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Tilings and Quasiperiodicity. Theor. Comput. Sci. 221(1-2): 61-75 (1999)
1998
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin: Deterministic Rational Transducers and Random Sequences. FoSSaCS 1998: 258-272
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Sylvain Porrot: Comparison Between the Complexity of a Function and the Complexity of Its Graph. MFCS 1998: 732-739
1997
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Tilings and Quasiperiodicity. ICALP 1997: 65-75
1996
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Self-Similarity Viewed as a Local Property via Tile Sets. MFCS 1996: 312-323
1995
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand, Jacques Mazoyer: Growing Patterns in 1D Cellular Automata. FCT 1995: 211-220
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: A Random NP-Complete Problem for Inversion of 2D Cellular Automata. STACS 1995: 95-106
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: A Random NP-Complete Problem for Inversion of 2D Cellular Automata. Theor. Comput. Sci. 148(1): 19-32 (1995)
1994
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: The Surjectivity Problem for 2D Cellular Automata. J. Comput. Syst. Sci. 49(3): 718-725 (1994)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Inversion of 2D Cellular Automata: Some Complexity Results. Theor. Comput. Sci. 134(2): 387-401 (1994)
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Automates cellulaires - reversibilite et complexite. L'Ecole Normale Supérieure Lyon 1994: 1-64
1993
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof. FCT 1993: 204-211
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruno Durand: Global Properties of 2D Cellular Automata: Some Complexity Results. MFCS 1993: 433-441

Coauthor Index

1Alexis Ballier [40] [42] [53]
2Vincent Bernardi [32] [34]
3Julien Cervelle [16] [21] [30]
4Max Dauchet [12]
5Volker Diekert [35] [37]
6Jean-Christophe Dubacq [17]
7Anne-Cécile Fabret [14]
8Enrico Formenti [17] [21] [27] [28] [29] [32] [34]
9Aristide Grange [28]
10Emmanuel Jeandel [40] [42] [53]
11Vladimir Kanovei [26]
12Jarkko Kari [32] [34]
13Leonid A. Levin [19] [20] [38]
14Jacques Mazoyer [8]
15Andrej Muchnik (Andrei A. Muchnik) [33]
16Sylvain Porrot [11] [12] [24]
17Victor Poupet [48]
18Zsuzsanna Róka [27] [28]
19Andrei E. Romashchenko [39] [41] [44] [45] [46] [47] [50] [51] [52] [54] [55] [56]
20Alexander Shen [15] [18] [19] [20] [23] [38] [39] [41] [44] [45] [46] [47] [50] [51] [52] [54] [55] [56]
21Wolfgang Thomas [36]
22Maxim Ushakov (M. A. Ushakov) [33]
23Vladimir A. Uspensky [26]
24Georges Varouchas [29]
25Nikolai K. Vereshchagin (Nikolay K. Vereshchagin) [12] [15] [18] [23] [26] [31] [33]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page