E. Jeandel

Most-cited papers

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
E. Jeandel, S. Perdrix, R. Vilmart
2017Logic in Computer Science139 citations Open access
Semantic Scholar
Quantum automata and algebraic groups
H. Derksen, E. Jeandel, P. Koiran
2005Journal of symbolic computation87 citations Open access
Semantic Scholar
Decidable and Undecidable Problems about Quantum Automata
V. Blondel, E. Jeandel, P. Koiran, N. Portier
2003SIAM journal on computing (Print)84 citations Open access
Semantic Scholar
An aperiodic set of 11 Wang tiles
E. Jeandel, M. Rao
2015Advances in Combinatorics81 citations Open access
Semantic Scholar
Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
E. Jeandel, S. Perdrix, R. Vilmart
2018Logic in Computer Science67 citations Open access
Semantic Scholar
Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles
Constantin Dalyac, L. Henriet, E. Jeandel, W. Lechner +3 more
2020EPJ Quantum Technology58 citations Open access
Semantic Scholar
Completeness of the ZX-Calculus
E. Jeandel, S. Perdrix, R. Vilmart
2019Log. Methods Comput. Sci.51 citations Open access
Semantic Scholar
Completeness of Graphical Languages for Mixed States Quantum Mechanics
T. Carette, E. Jeandel, S. Perdrix, R. Vilmart
2019International Colloquium on Automata, Languages and Programming42 citations Open access
Semantic Scholar
Structural aspects of tilings
Alexis Ballier, B. Durand, E. Jeandel
2008Symposium on Theoretical Aspects of Computer Science41 citations
Semantic Scholar
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness
E. Jeandel, S. Perdrix, R. Vilmart
2018Logic in Computer Science26 citations Open access
Semantic Scholar
Computability of the entropy of one-tape Turing machines
E. Jeandel
2013Symposium on Theoretical Aspects of Computer Science26 citations Open access
Semantic Scholar
Turing degrees of multidimensional SFTs
E. Jeandel, Pascal Vanier
2011Theoretical Computer Science26 citations Open access
Semantic Scholar
About the Domino Problem for Subshifts on Groups
Nathalie Aubrun, S. Barbieri, E. Jeandel
201825 citations Open access
Semantic Scholar
ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics
E. Jeandel, S. Perdrix, R. Vilmart, Quan-Long Wang
2017International Symposium on Mathematical Foundations of Computer Science25 citations
Semantic Scholar
Translation-like Actions and Aperiodic Subshifts on Groups
E. Jeandel
2015arXiv.org21 citations
Semantic Scholar
Characterizations of periods of multi-dimensional shifts
E. Jeandel, Pascal Vanier
2013Ergodic Theory and Dynamical Systems20 citations Open access
Semantic Scholar
Aperiodic Subshifts of Finite Type on Groups
E. Jeandel
201518 citations
Semantic Scholar
Tilings and model theory
Alexis Ballier, E. Jeandel
2008Journées Automates Cellulaires17 citations
Semantic Scholar
Topological Automata
E. Jeandel
2005Theory of Computing Systems17 citations
Semantic Scholar
Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type
E. Jeandel, Pascal Vanier
2013Symposium on Theoretical Aspects of Computer Science14 citations Open access
Semantic Scholar
Computing (or not) Quasi-periodicity Functions of Tilings
Alexis Ballier, E. Jeandel
2010Journées Automates Cellulaires13 citations
Semantic Scholar
Aperiodic Subshifts on Polycyclic Groups
E. Jeandel
2015arXiv.org12 citations
Semantic Scholar
On Immortal Configurations in Turing Machines
E. Jeandel
2012Conference on Computability in Europe12 citations Open access
Semantic Scholar
Addition and Differentiation of ZX-Diagrams
E. Jeandel, S. Perdrix, M. Veshchezerova
2022International Conference on Formal Structures for Computation and Deduction11 citations Open access
Semantic Scholar
A Recipe for Quantum Graphical Languages
T. Carette, E. Jeandel
2020International Colloquium on Automata, Languages and Programming11 citations
Semantic Scholar
The periodic domino problem revisited
E. Jeandel
2010Theoretical Computer Science11 citations Open access
Semantic Scholar
Y-Calculus: A language for real Matrices derived from the ZX-Calculus
E. Jeandel, S. Perdrix, R. Vilmart
2017QPL10 citations Open access
Semantic Scholar
Structuring multi-dimensional subshifts
Alexis Ballier, E. Jeandel
2013arXiv.org10 citations
Semantic Scholar
Fixed Parameter Undecidability for Wang Tilesets
E. Jeandel, N. Rolin
2012AUTOMATA & JAC9 citations Open access
Semantic Scholar
Periodicity in tilings
E. Jeandel, Pascal Vanier
2009International Conference on Developments in Language Theory9 citations Open access
Semantic Scholar
Subshifts, Languages and Logic
E. Jeandel, G. Theyssier
2009International Conference on Developments in Language Theory9 citations Open access
Semantic Scholar
Some Notes about Subshifts on Groups
E. Jeandel
2015arXiv.org8 citations
Semantic Scholar
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs
Emmanuel Hainry, E. Jeandel, Romain Péchoux, Olivier Zeyen
2021International Colloquium on Theoretical Aspects of Computing7 citations Open access
Semantic Scholar
A Characterization of Subshifts with Computable Language
E. Jeandel, Pascal Vanier
2019Symposium on Theoretical Aspects of Computer Science7 citations
Semantic Scholar
Undecidable word problem in subshift automorphism groups
Pierre Guillon, E. Jeandel, J. Kari, Pascal Vanier
2018Computer Science Symposium in Russia7 citations Open access
Semantic Scholar
Enumeration reducibility in closure spaces with applications to logic and algebra
E. Jeandel
2015Logic in Computer Science7 citations
Semantic Scholar
Finding a vector orthogonal to roughly half a collection of vectors
Pierre Charbit, E. Jeandel, P. Koiran, Sylvain Perifel +1 more
2008Journal of Complexity7 citations Open access
Semantic Scholar
Computability in Symbolic Dynamics
E. Jeandel
2016Conference on Computability in Europe6 citations Open access
Semantic Scholar
Enumeration in Closure Spaces with Applications to Algebra
E. Jeandel
2015arXiv.org6 citations
Semantic Scholar
Infinite Communication Complexity
Pierre Guillon, E. Jeandel
2015arXiv.org5 citations
Semantic Scholar
The rational fragment of the ZX-calculus
E. Jeandel
2018arXiv.org4 citations
Semantic Scholar
Slopes of Tilings
E. Jeandel, Pascal Vanier
2010Journées Automates Cellulaires4 citations
Semantic Scholar
Type-safe Quantum Programming in Idris
Liliane-Joy Dandy, E. Jeandel, V. Zamdzhiev
2023European Symposium on Programming3 citations Open access
Semantic Scholar
P01\it \Pi^0_1 Sets and Tilings
E. Jeandel, Pascal Vanier
2011Theory and Applications of Models of Computation3 citations Open access
Semantic Scholar
Tilings Robust to Errors
Alexis Ballier, B. Durand, E. Jeandel
2010Latin American Symposium on Theoretical Informatics3 citations
Semantic Scholar
Subshifts as models for MSO logic
E. Jeandel, G. Theyssier
2009Information and Computation3 citations Open access
Semantic Scholar
Playing with Conway's problem
E. Jeandel, Nicolas Ollinger
2008Theoretical Computer Science3 citations Open access
Semantic Scholar
Invariants in Linear Optics
Sébastien Draux, S. Perdrix, E. Jeandel, Shane Mansfield
20252 citations
Semantic Scholar
Strong shift equivalence as a category notion
E. Jeandel
2021arXiv.org2 citations
Semantic Scholar
The Undecidability of the Domino Problem
E. Jeandel, Pascal Vanier
2020Lecture notes in mathematics2 citations Open access
Semantic Scholar