Emmanuel Jeandel

Orcid: 0000-0001-7236-2906

According to our database1, Emmanuel Jeandel authored at least 55 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Addition and Differentiation of ZX-diagrams.
Log. Methods Comput. Sci., 2024

2023
Type-safe Quantum Programming in Idris.
Proceedings of the Programming Languages and Systems, 2023

2022
Amoebae for Clustering: A Bio-Inspired Cellular Automata Method for Data Classification.
Proceedings of the Automata and Complexity, 2022

2021
Qimaera: Type-safe (Variational) Quantum Programming in Idris.
CoRR, 2021

Strong shift equivalence as a category notion.
CoRR, 2021

ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

2020
Slopes of Multidimensional Subshifts.
Theory Comput. Syst., 2020

Completeness of the ZX-Calculus.
Log. Methods Comput. Sci., 2020

A Recipe for Quantum Graphical Languages.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
A Characterization of Subshifts with Computable Language.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Completeness of Graphical Languages for Mixed States Quantum Mechanics.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Undecidable Word Problem in Subshift Automorphism Groups.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
The rational fragment of the ZX-calculus.
CoRR, 2018

Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive.
CoRR, 2017

Y-Calculus: A language for real Matrices derived from the ZX-Calculus.
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Enumeration reducibility in closure spaces with applications to logic and algebra.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Computability in Symbolic Dynamics.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Hardness of conjugacy, embedding and factorization of multidimensional subshifts.
J. Comput. Syst. Sci., 2015

An aperiodic set of 11 Wang tiles.
CoRR, 2015

Aperiodic Subshifts on Polycyclic Groups.
CoRR, 2015

Translation-like Actions and Aperiodic Subshifts on Groups.
CoRR, 2015

Enumeration in Closure Spaces with Applications to Algebra.
CoRR, 2015

Some Notes about Subshifts on Groups.
CoRR, 2015

Infinite Communication Complexity.
CoRR, 2015

2014
Computability of the entropy of one-tape Turing machines.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013
Turing degrees of multidimensional SFTs.
Theor. Comput. Sci., 2013

Subshifts as models for MSO logic.
Inf. Comput., 2013

Characterizations of periods of multidimensional shifts
CoRR, 2013

Structuring multi-dimensional subshifts.
CoRR, 2013

Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012
Fixed Parameter Undecidability for Wang Tilesets
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

Hardness of conjugacy and factorization of multidimensional subshifts of finite type
CoRR, 2012

On Immortal Configurations in Turing Machines.
Proceedings of the How the World Computes, 2012

2011
Pi01 sets and tilings
CoRR, 2011

P<sup>0</sup><sub>1</sub>\it \Pi^0_1 Sets and Tilings.
Proceedings of the Theory and Applications of Models of Computation, 2011

Propriétés structurelles et calculatoires des pavages. (Structural and computational properties of tilings).
, 2011

2010
The periodic domino problem revisited.
Theor. Comput. Sci., 2010

Tilings Robust to Errors.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Slopes of Tilings.
Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

Computing (or not) Quasi-periodicity Functions of Tilings.
Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

Periodicity in Tilings.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Subshifts and Logic: Back and Forth
CoRR, 2009

Subshifts, Languages and Logic.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
Playing with Conway's problem.
Theor. Comput. Sci., 2008

Finding a vector orthogonal to roughly half a collection of vectors.
J. Complex., 2008

Structural aspects of tilings.
Proceedings of the STACS 2008, 2008

Tilings and model theory.
Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

2007
Topological Automata.
Theory Comput. Syst., 2007

2005
Decidable and Undecidable Problems about Quantum Automata.
SIAM J. Comput., 2005

Quantum automata and algebraic groups.
J. Symb. Comput., 2005

2004
Universality in Quantum Computation.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004


  Loading...