Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
[1]
O. 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
[2]
N. 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
[3]
N. 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
[4]
H. 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
[5]
N. Gauville.
Système robuste de diagnostic décentralisé à l'aide d'automates cellulaires simples, Université de Lorraine (Nancy), September 2018.
https://hal.inria.fr/hal-01894581
[6]
I. 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
[7]
E. 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
[8]
M. 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
[9]
M. 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
[10]
E. 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
[11]
E. 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
[12]
S. 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

Doctoral Dissertations and Habilitation Theses

[13]
S. Perdrix.
Approches Graphiques en Informatique Quantique, Université de Lorraine, September 2019, Habilitation à diriger des recherches.
https://hal.archives-ouvertes.fr/tel-02400128
[14]
R. Vilmart.
ZX-Calculi for Quantum Computing and their Completeness, Université de Lorraine, September 2019.
https://hal.archives-ouvertes.fr/tel-02395443

Articles in International Peer-Reviewed Journals

[15]
A. Anshu, P. Høyer, M. Mhalla, S. Perdrix.
Contextuality in multipartite pseudo-telepathy graph games, in: Journal of Computer and System Sciences, February 2020, vol. 107, pp. 156-165. [ DOI : 10.1016/j.jcss.2019.06.005 ]
https://hal.archives-ouvertes.fr/hal-02400051
[16]
P. Arrighi, S. Martiel, S. Perdrix.
Reversible causal graph dynamics: invertibility, block representation, vertex-preservation, in: Natural Computing, October 2019. [ DOI : 10.1007/s11047-019-09768-0 ]
https://hal.archives-ouvertes.fr/hal-02400095
[17]
T. Carette, M. Laurière, F. Magniez.
Extended Learning Graphs for Triangle Finding, in: Algorithmica, 2019, forthcoming. [ DOI : 10.1007/s00453-019-00627-z ]
https://hal-cnrs.archives-ouvertes.fr/hal-02349981
[18]
M. Couceiro, E. Lehtonen, P. Mercuriali, R. Péchoux.
On the efficiency of normal form systems for representing Boolean functions, in: Theoretical Computer Science, 2019, forthcoming.
https://hal.inria.fr/hal-02153506
[19]
M. Couceiro, P. Mercuriali, R. Péchoux, A. Saffidine.
On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials, in: Journal of Multiple-Valued Logic and Soft Computing, 2019, vol. 33, no 3, pp. 197-218, forthcoming.
https://hal.inria.fr/hal-01905491
[20]
N. Fatès.
A tutorial on Elementary cellular automata with fully asynchronous updating -General properties and convergence dynamics, in: Natural Computing, 2019, forthcoming.
https://hal.inria.fr/hal-02400792
[21]
N. Fatès.
Remarks on the cellular automaton global synchronisation problem – deterministic vs. stochastic models, in: Natural Computing, September 2019, vol. 18, no 3, pp. 429-424. [ DOI : 10.1007/s11047-018-9683-0 ]
https://hal.inria.fr/hal-01653631
[22]
E. Jeandel, E. Moutot, P. Vanier.
Slopes of multidimensional subshifts, in: Theory of Computing Systems, 2019, forthcoming. [ DOI : 10.1007/s00224-019-09931-1 ]
https://hal.inria.fr/hal-02158012

International Conferences with Proceedings

[23]
T. Carette, D. Horsman, S. Perdrix.
SZX-calculus: Scalable Graphical Quantum Reasoning, in: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Aachen, Germany, Leibniz International Proceedings in Informatics (LIPIcs), August 2019, vol. 138, pp. 55:1–55:15, https://arxiv.org/abs/1905.00041. [ DOI : 10.4230/LIPIcs.MFCS.2019.55 ]
https://hal.archives-ouvertes.fr/hal-02400070
[24]
T. Carette, S. Perdrix, R. Vilmart, E. Jeandel.
Completeness of Graphical Languages for Mixed States Quantum Mechanics, in: ICALP, Patras, Greece, LIPICS, 2019, vol. 132. [ DOI : 10.4230/LIPIcs.ICALP.2019.108 ]
https://hal.archives-ouvertes.fr/hal-02025720
[25]
P. Guillon, E. Jeandel, J. Kari, P. Vanier.
Undecidable word problem in subshift automorphism groups, in: Computer Science in Russia 2019, Novosibirsk, Russia, R. van Bevern (editor), Lecture Notes in Computer Science, Springer, July 2019, https://arxiv.org/abs/1808.09194.
https://hal.archives-ouvertes.fr/hal-01862896
[26]
M. Hoyrup, C. Rojas, V. Selivanov, D. M. Stull.
Computability on quasi-Polish spaces, in: DCFS 2019 - 21st International Conference on Descriptional Complexity of Formal Systems, Kosice, Slovakia, M. Hospodár, G. Jirásková, S. Konstantinidis (editors), Descriptional Complexity of Formal Systems, Springer International Publishing, July 2019, vol. LNCS-11612, pp. 171-183.
https://hal.inria.fr/hal-02118947
[27]
M. Hoyrup, D. M. Stull.
Semicomputable points in Euclidean spaces, in: MFCS 2019: 44th International Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, August 2019. [ DOI : 10.4230/LIPIcs.MFCS.2019.63 ]
https://hal.inria.fr/hal-02154825
[28]
E. Jeandel, S. Perdrix, R. Vilmart.
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness, in: 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Vancouver, Canada, June 2019. [ DOI : 10.1109/LICS.2019.8785754 ]
https://hal.archives-ouvertes.fr/hal-01791791
[29]
E. Jeandel, P. Vanier.
A Characterization of Subshifts with Computable Language, in: STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, March 2019.
https://hal.archives-ouvertes.fr/hal-02133469

National Conferences with Proceedings

[30]
N. Gauville, N. Fatès, I. Marcovici.
Diagnostic décentralisé à l'aide d'automates cellulaires, in: JFSMA 2019 - 27emes Journées Francophones sur les Systèmes Multi-Agents, Toulouse, France, Cépaduès, July 2019, ISBN 9782364937192.
https://hal.inria.fr/hal-02195799

Conferences without Proceedings

[31]
R. Vilmart.
A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics, in: 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Vancouver, Canada, June 2019. [ DOI : 10.1109/LICS.2019.8785765 ]
https://hal.archives-ouvertes.fr/hal-01963426
[32]
N. de Beaudrap, R. Duncan, D. Horsman, S. Perdrix.
Pauli Fusion: a computational model to realise quantum transformations from ZX terms, in: QPL'19 : International Conference on Quantum Physics and Logic, Los Angeles, United States, June 2019, https://arxiv.org/abs/1904.12817 - 12 pages + appendices.
https://hal.archives-ouvertes.fr/hal-02413388

Scientific Books (or Scientific Book chapters)

[33]
N. Fatès, I. Marcovici, S. Taati.
Cellular automata for the self-stabilisation of colourings and tilings, in: Proceedings of RP 2019 (International Conference on Reachability Problems), September 2019, pp. 121-136. [ DOI : 10.1007/978-3-030-30806-3_10 ]
https://hal.inria.fr/hal-02159155

Scientific Popularization

[34]
N. Fatès, I. Marcovici.
Les automates cellulaires jouent le jeu, in: La Recherche : l'actualité des sciences, September 2019, no Numéro spécial 31, Réédition après changements mineurs de l'article " Automates cellulaires : la complexité dans les règles de l'art" https://hal.inria.fr/hal-01847663.
https://hal.inria.fr/hal-02381102

Other Publications

[35]
A. Callard, M. Hoyrup.
Descriptive complexity on non-Polish spaces, January 2020, working paper or preprint. [ DOI : 10.4230/LIPIcs.STACS.2020.4 ]
https://hal.inria.fr/hal-02298815
[36]
T. Carette, M. Laurière, F. Magniez.
Extended Learning Graphs for Triangle Finding, April 2019, https://arxiv.org/abs/1609.07786 - Fixing few typos in references.
https://hal.archives-ouvertes.fr/hal-02107535
[37]
E. Jeandel, S. Perdrix, R. Vilmart.
Completeness of the ZX-Calculus, December 2019, https://arxiv.org/abs/1903.06035 - Contains an appendix. arXiv admin note: text overlap with arXiv:1801.10142.
https://hal.archives-ouvertes.fr/hal-02400081
References in notes
[38]
A. Aspect, P. Grangier, G. Roger.
Experimental tests of realistic local theories via Bell's theorem, in: Phys. Rev. Lett., 1981, vol. 47, 460 p.
[39]
C. 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.
[40]
N. 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
[41]
E. 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. [ DOI : 10.1145/3209108.3209131 ]
https://hal.archives-ouvertes.fr/hal-01529623
[42]
K. Weihrauch.
Computable Analysis, Springer, 2000.