EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1O. Bournez, D. Graça, E. Hainry.

    Computation with perturbed dynamical systems, in: Journal of Computer and System Sciences, August 2013, vol. 79, no 5, pp. 714-724. [ DOI : 10.1016/j.jcss.2013.01.025 ]

    http://hal.inria.fr/hal-00861041
  • 2N. Fatès, I. Marcovici, S. Taati.

    Two-dimensional traffic rules and the density classification problem, in: International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2016, Zürich, France, Lecture Notes of Computer Science, June 2016, vol. 9664. [ DOI : 10.1007/978-3-319-39300-1_11 ]

    https://hal.inria.fr/hal-01290290
  • 3H. Férée, E. Hainry, M. Hoyrup, R. Péchoux.

    Characterizing polynomial time complexity of stream programs using interpretations, in: Journal of Theoretical Computer Science (TCS), January 2015, vol. 585, pp. 41-54. [ DOI : 10.1016/j.tcs.2015.03.008 ]

    https://hal.inria.fr/hal-01112160
  • 4I. Gnaedig, H. Kirchner.

    Proving Weak Properties of Rewriting, in: Theoretical Computer Science, 2011, vol. 412, pp. 4405-4438. [ DOI : 10.1016/j.tcs.2011.04.028 ]

    http://hal.inria.fr/inria-00592271/en
  • 5E. Hainry, R. Péchoux.

    Objects in Polynomial Time, in: APLAS 2015, Pohang, South Korea, X. Feng, S. Park (editors), Lecture Notes in Computer Science, Springer, November 2015, vol. 9458, pp. 387–404. [ DOI : 10.1007/978-3-319-26529-2_21 ]

    https://hal.inria.fr/hal-01206161
  • 6M. Hoyrup, W. Gomaa.

    On the extension of computable real functions, in: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, IEEE Computer Society, 2017, pp. 1–12.

    https://doi.org/10.1109/LICS.2017.8005067
  • 7M. Hoyrup.

    The decidable properties of subrecursive functions, in: International Colloquium on Automata, Languages, and Programming (ICALP) 2016, Rome, Italy, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 12-15, 2016, Rome, Italy, July 2016. [ DOI : 10.4230/LIPIcs.ICALP.2016.108 ]

    https://hal.inria.fr/hal-01308224
  • 8E. Jeandel.

    Computability of the entropy of one-tape Turing Machines, in: STACS - Symposium on Theoretical Aspects of Computer Science, Lyon, France, E. Mayr, N. Portier (editors), LIPCS, March 2014, vol. 25, pp. 421-432, First version. [ DOI : 10.4230/LIPIcs.STACS.2014.421 ]

    https://hal.inria.fr/hal-00785232
  • 9E. Jeandel, P. Vanier.

    Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type, in: STACS - 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, N. Portier, T. Wilke (editors), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, February 2013, vol. 20, pp. 490–501. [ DOI : 10.4230/LIPIcs.STACS.2013.490 ]

    http://hal.inria.fr/hal-00840384
  • 10S. Perdrix, Q. Wang.

    Supplementarity is Necessary for Quantum Diagram Reasoning *, in: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Krakow, Poland, Leibniz International Proceedings in Informatics (LIPIcs), August 2016, vol. 58, pp. 76:1–76:14. [ DOI : 10.4230/LIPIcs.MFCS.2016.76 ]

    https://hal.archives-ouvertes.fr/hal-01361419
Publications of the year

Articles in International Peer-Reviewed Journals

Invited Conferences

  • 13M. Hoyrup.

    Topological analysis of representations, in: CiE 2018 - Fourteenth conference on Computability in Europe, Kiel, Germany, July 2018.

    https://hal.inria.fr/hal-01919395

International Conferences with Proceedings

  • 14N. A. Fatès.

    A pedagogical example: a family of stochastic cellular automata that plays Alesia, in: ACRI 2018 - 13th International Conference on Cellular Automata for Research and Industry, Como, Italy, International Conference on Cellular Automata (ACRI 2018), September 2018, vol. LNCS, no 11115. [ DOI : 10.1007/978-3-319-99813-8_35 ]

    https://hal.inria.fr/hal-01936310
  • 15M. Hoyrup, D. Nava Saucedo, D. M. Stull.

    Semicomputable geometry, in: ICALP 2018 - 45th International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic, July 2018.

    https://hal.inria.fr/hal-01770562
  • 16E. Jeandel, S. Perdrix, R. Vilmart.

    A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics, in: The 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, United Kingdom, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, July 2018, pp. 559–568, https://arxiv.org/abs/1705.11151. [ DOI : 10.1145/3209108.3209131 ]

    https://hal.archives-ouvertes.fr/hal-01529623
  • 17E. Jeandel, S. Perdrix, R. Vilmart.

    Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics, in: The 33rd Annual Symposium on Logic in Computer Science, Oxford, United Kingdom, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, July 2018, pp. 569–578, https://arxiv.org/abs/1801.10142. [ DOI : 10.1145/3209108.3209139 ]

    https://hal.archives-ouvertes.fr/hal-01716501
  • 18I. Marcovici, T. Stoll, P.-A. Tahay.

    Construction of Some Nonautomatic Sequences by Cellular Automata, in: AUTOMATA 2018 - 24th International Workshop on Cellular Automata and Discrete Complex Systems, Ghent, Belgium, J. M. Baetens, M. Kutrib (editors), Cellular Automata and Discrete Complex Systems, Springer International Publishing, June 2018, vol. LNCS-10875, pp. 113-126. [ DOI : 10.1007/978-3-319-92675-9_9 ]

    https://hal.inria.fr/hal-01824876

Scientific Books (or Scientific Book chapters)

  • 19N. Fatès, V. Chevrier, O. Bouré.

    Is there a trade-off between simplicity and robustness? Illustration on a lattice-gas model of swarming, in: Probabilistic Cellular Automata, P.-Y. Louis, F. R. Nardi (editors), Emergence, Complexity and Computation, Springer, 2018. [ DOI : 10.1007/978-3-319-65558-1_16 ]

    https://hal.inria.fr/hal-01230145
  • 20N. A. Fatès.

    Asynchronous cellular automata, in: Encyclopedia of Complexity and Systems Science, R. Meyers (editor), Springer, 2018, 21 p, This text has been proposed for the Encyclopedia of Complexity and Systems Science edited by Springer Nature and should appear in 2018. [ DOI : 10.1007/978-3-642-27737-5_671-1 ]

    https://hal.inria.fr/hal-01653675
  • 21N. Fatès, B. Sethi, S. Das.

    On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view, in: Reversibility and Universality, Springer, 2018. [ DOI : 10.1007/978-3-319-73216-9_15 ]

    https://hal.inria.fr/hal-01571847

Internal Reports

  • 22S. Ben Ayed.

    All aspects of inductive reasoning : Validité, limites, formes et aspects récents du raisonnement inductif, Inria Nancy - Grand Est, August 2018, Stage de 2ème année de l'Ecole Supérieure Nationale des Mines de Nancy.

    https://hal.archives-ouvertes.fr/hal-01885909

Scientific Popularization

  • 23N. A. Fatès, I. Marcovici.

    Automates cellulaires : la complexité dans les règles de l'art, in: La Recherche : l'actualité des sciences, July 2018.

    https://hal.inria.fr/hal-01847663

Other Publications

References in notes
  • 34A. Aspect, P. Grangier, G. Roger.

    Experimental tests of realistic local theories via Bell's theorem, in: Phys. Rev. Lett., 1981, vol. 47, 460 p.
  • 35C. H. Bennett, G. Brassard.

    Quantum cryptography: Public key distribution and coin tossing, in: Proceedings of IEEE international Conference on Computers, Systems and Signal Processing, Bangalore, India, New York, IEEE Press, 1984, 175 p.
  • 36B. Coecke, R. Duncan.

    Interacting quantum observables: categorical algebra and diagrammatics, in: New Journal of Physics, apr 2011, vol. 13, no 4, 043016 p.
  • 37B. Coecke, A. Kissinger.

    Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning, Cambridge University Press, 2017.

    http://dx.doi.org/10.1017/9781316219317
  • 38F. Dupuis, O. Fawzi, R. Renner.

    Entropy accumulation, 2016, Submitted to Communications in Mathematical Physics.
  • 39N. Fatès.

    Solving the decentralised gathering problem with a reaction-diffusion-chemotaxis scheme - Social amoebae as a source of inspiration, in: Swarm Intelligence, 2010, vol. 4, no 2, pp. 91–115.

    http://dx.doi.org/10.1007/s11721-010-0038-4
  • 40K. Weihrauch.

    Computable Analysis, Springer, 2000.


previous Previous | up Home