The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bruno Durand: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bruno Durand, Enrico Formenti, Aristide Grange, Zsuzsanna Róka
    Number conserving cellular automata: new results on decidability and dynamics. [Citation Graph (0, 0)][DBLP]
    DMCS, 2003, pp:129-140 [Conf]
  2. Bruno Durand, Enrico Formenti, Georges Varouchas
    On undecidability of equicontinuity classification for cellular automata. [Citation Graph (0, 0)][DBLP]
    DMCS, 2003, pp:117-128 [Conf]
  3. Bruno Durand
    Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:204-211 [Conf]
  4. Bruno Durand, Jacques Mazoyer
    Growing Patterns in 1D Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:211-220 [Conf]
  5. Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin
    Deterministic Rational Transducers and Random Sequences. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1998, pp:258-272 [Conf]
  6. Bruno Durand
    Tilings and Quasiperiodicity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:65-75 [Conf]
  7. Bruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin
    Ecological Turing Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:457-468 [Conf]
  8. Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari
    A New Dimension Sensitive Property for Cellular Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:416-426 [Conf]
  9. Julien Cervelle, Bruno Durand, Enrico Formenti
    Algorithmic Information Theory and Cellular Automata Dynamics. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:248-259 [Conf]
  10. Bruno Durand
    Global Properties of 2D Cellular Automata: Some Complexity Results. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:433-441 [Conf]
  11. Bruno Durand
    Self-Similarity Viewed as a Local Property via Tile Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:312-323 [Conf]
  12. Bruno Durand, Sylvain Porrot
    Comparison Between the Complexity of a Function and the Complexity of Its Graph. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:732-739 [Conf]
  13. Julien Cervelle, Bruno Durand
    Tilings: Recursivity and Regularity. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:491-502 [Conf]
  14. Bruno Durand
    A Random NP-Complete Problem for Inversion of 2D Cellular Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:95-106 [Conf]
  15. Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
    Descriptive Complexity of Computable Sequences. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:153-162 [Conf]
  16. Bruno Durand, Leonid A. Levin, Alexander Shen
    Complex tilings. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:732-739 [Conf]
  17. Bruno Durand, Leonid A. Levin, Alexander Shen
    Complex Tilings [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  18. Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
    Descriptive complexity of computable sequences [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:087, pp:- [Journal]
  19. Bruno Durand, Nikolai K. Vereshchagin
    Kolmogorov-Loveland stochasticity for finite strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:6, pp:263-269 [Journal]
  20. Bruno Durand
    The Surjectivity Problem for 2D Cellular Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:3, pp:718-725 [Journal]
  21. Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari
    A new dimension sensitive property for cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:235-247 [Journal]
  22. Julien Cervelle, Bruno Durand
    Tilings: recursivity and regularity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:469-477 [Journal]
  23. Bruno Durand
    Kolmogorov Complexity - Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:1- [Journal]
  24. Bruno Durand
    De la logique aux pavages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:311-324 [Journal]
  25. Bruno Durand
    Inversion of 2D Cellular Automata: Some Complexity Results. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:2, pp:387-401 [Journal]
  26. Bruno Durand
    A Random NP-Complete Problem for Inversion of 2D Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:1, pp:19-32 [Journal]
  27. Bruno Durand
    Tilings and Quasiperiodicity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:61-75 [Journal]
  28. Bruno Durand, Anne-Cécile Fabret
    On the Complexity of Deadlock Detection in Families of Planar Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:225-237 [Journal]
  29. Bruno Durand, Enrico Formenti, Zsuzsanna Róka
    Number-conserving cellular automata I: decidability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:523-535 [Journal]
  30. Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin
    Do stronger definitions of randomness exist? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1987-1996 [Journal]
  31. Bruno Durand, Sylvain Porrot
    Comparison between the complexity of a function and the complexity of its graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:37-46 [Journal]
  32. Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin
    Descriptive complexity of computable sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:47-58 [Journal]
  33. Jean-Christophe Dubacq, Bruno Durand, Enrico Formenti
    Kolmogorov complexity and cellular automata classification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:271-285 [Journal]
  34. Volker Diekert, Bruno Durand
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:301- [Journal]

  35. Effective Closed Subshifts in 1D Can Be Implemented in 2D. [Citation Graph (, )][DBLP]


  36. Fixed Point and Aperiodic Tilings. [Citation Graph (, )][DBLP]


  37. Asymptotic Cellular Complexity. [Citation Graph (, )][DBLP]


  38. High Complexity Tilings with Sparse Errors. [Citation Graph (, )][DBLP]


  39. Tilings Robust to Errors. [Citation Graph (, )][DBLP]


  40. Structural aspects of tilings. [Citation Graph (, )][DBLP]


  41. Preface. [Citation Graph (, )][DBLP]


  42. Fixed Point and Aperiodic Tilings [Citation Graph (, )][DBLP]


  43. Structural aspects of tilings [Citation Graph (, )][DBLP]


  44. Fixed-point tile sets and their applications [Citation Graph (, )][DBLP]


  45. Fixed point theorem and aperiodic tilings [Citation Graph (, )][DBLP]


  46. Effective closed subshifts in 1D can be implemented in 2D [Citation Graph (, )][DBLP]


  47. Fixed Point and Aperiodic Tilings. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002