Emmanuel Jeandel
Présentation
Publications
Publications
|
|
An aperiodic set of 11 Wang tilesAdvances in Combinatorics, 2021, ⟨10.19086/aic.18614⟩ |
|
|
Completeness of Graphical Languages for Mixed State Quantum MechanicsACM Transactions on Quantum Computing, 2021, ACM Transactions on Quantum Computing, 2 (4), pp.1-28. ⟨10.1145/3464693⟩ |
|
|
Slopes of multidimensional subshiftsTheory of Computing Systems, 2020, 64 (1), pp.35-61. ⟨10.1007/s00224-019-09931-1⟩ |
|
|
Completeness of the ZX-CalculusLogical Methods in Computer Science, 2020, 16 (2), pp.11:1 -- 11:72. ⟨10.23638/LMCS-16(2:11)2020⟩ |
|
|
Hardness of conjugacy, embedding and factorization of multidimensional subshiftsJournal of Computer and System Sciences, 2015, http://dx.doi.org/10.1016/j.jcss.2015.05.003. ⟨10.1016/j.jcss.2015.05.003⟩ |
|
|
Characterizations of periods of multidimensional shiftsErgodic Theory and Dynamical Systems, 2015, 35 (2), pp.431--460. ⟨10.1017/etds.2013.60⟩ |
|
|
Turing degrees of multidimensional subshiftsTheoretical Computer Science, 2013, http://dx.doi.org/10.1016/j.tcs.2012.08.027. ⟨10.1016/j.tcs.2012.08.027⟩ |
|
|
Subshifts as models for MSO logicInformation and Computation, 2013, 225, pp.1-15. ⟨10.1016/j.ic.2013.01.003⟩ |
|
|
Characterizations of periods of multi-dimensional shiftsErgodic Theory and Dynamical Systems, 2013, FirstView, pp.1--30. ⟨10.1017/etds.2013.60⟩ |
|
|
Periodicity in tilingsDevelopments in Language Theory, 2010, 6224/2010, pp.243-254. ⟨10.1007/978-3-642-14455-4_23⟩ |
|
|
Finding a Vector Orthogonal to Roughly Half a Collection of VectorsJournal of Complexity, 2008, 24, pp.39-53. ⟨10.1016/j.jco.2006.09.005⟩ |
|
|
Decidable and Undecidable Problems about Quantum AutomataSIAM Journal on Computing, 2005, 34 (6), pp.1464-1473. ⟨10.1137/S0097539703425861⟩ |
|
|
Quantum automata and algebraic groupsJournal of Symbolic Computation, 2005, 39 (3-4), pp.357-371. ⟨10.1016/j.jsc.2004.11.008⟩ |
|
|
Type-safe Quantum Programming in IdrisESOP 2023 - European Symposium on Programming, Apr 2023, Paris, France. pp.507-534, ⟨10.1007/978-3-031-30044-8_19⟩ |
|
|
Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehiclesROADEF 2022 - 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France |
|
|
Strong Shift Equivalence and Bialgebras in traced monoidal categoriesThe 5th International Conference on Applied Category Theory 2022, 2022, Strathclyde, United Kingdom |
Addition and Differentiation of ZX-Diagrams7th International Conference on Formal Structures for > Computation and Deduction (FSCD 2022), Aug 2022, Haifa (Israël), France. ⟨10.4230/LIPIcs.FSCD.2022.13⟩ |
|
|
|
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java ProgramsICTAC 2021 - 18th International Colloquium on Theoretical Aspects of Computing, Sep 2021, Nur-Sultan/Virtual, Kazakhstan. pp.357-365, ⟨10.1007/978-3-030-85315-0_20⟩ |
|
|
A recipe for quantum graphical languagesICALP 2020, 2020, Saarbrücken, Germany |
|
|
Undecidable word problem in subshift automorphism groupsComputer Science in Russia 2019, Jul 2019, Novosibirsk, Russia |
|
|
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle CompletenessLICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. ⟨10.1109/LICS.2019.8785754⟩ |
|
|
Completeness of Graphical Languages for Mixed States Quantum MechanicsICALP, 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.108⟩ |
A Characterization of Subshifts with Computable LanguageSTACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany |
|
|
|
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum MechanicsThe 33rd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2018, Jul 2018, Oxford, United Kingdom. pp.559--568, ⟨10.1145/3209108.3209131⟩ |
|
|
Diagrammatic Reasoning beyond Clifford+T Quantum MechanicsThe 33rd Annual Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.569--578, ⟨10.1145/3209108.3209139⟩ |
|
|
Y-Calculus: A language for real Matrices derived from the ZX-CalculusInternational Conference on Quantum Physics and Logics (QPL), 2017, Nijmegen, Netherlands |
Enumeration reducibility in closure spaces with applications to logic and algebraLogic in Computer Science (LICS), 2017, reyjkavik, Iceland |
|
|
|
ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T quantum mechanicsMFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.15 |
|
|
Computability in Symbolic DynamicsCiE, Jun 2016, Paris, France. pp.124 - 131, ⟨10.1007/978-3-319-40189-8_13⟩ |
|
|
Computability of the entropy of one-tape Turing MachinesSTACS - Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.421-432, ⟨10.4230/LIPIcs.STACS.2014.421⟩ |
|
|
Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite TypeSTACS 2013 - 30th International Symposium on Theoretical Aspects of Computer Science, Christian-Albrechts - Universität zu Kiel, Feb 2013, Kiel, Germany. pp.490--501, ⟨10.4230/LIPIcs.STACS.2013.490⟩ |
|
|
On Immortal Configurations in Turing MachinesCiE: Computability in Europe, 2012, Cambridge, United Kingdom. pp.334-343, ⟨10.1007/978-3-642-30870-3_34⟩ |
|
|
Fixed Parameter Undecidability for Wang TilesetsJAC - 3rd International Symposium Journées Automates Cellulaires - 2012, Enrico Formenti, Sep 2012, Bastia, France. pp.69-85, ⟨10.4204/EPTCS.90.6⟩ |
|
|
Pi01 sets and tilingsTheory and Applications of Models of Computation - 8th Annual Conference, May 2011, Kyoto, Japan. pp.230-239, ⟨10.1007/978-3-642-20877-5_24⟩ |
|
|
Computing (or not) Quasi-periodicity Functions of TilingsJournées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.54-64 |
|
|
Slopes of TilingsJournées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.145-155 |
|
|
Subshifts, Languages and Logic13th International Conference on Developments in Language Theory, Jun 2009, Stuttgart, Germany |
|
|
Structural aspects of tilingsSTACS 2008, Feb 2008, Bordeaux, France. pp.61-72 |
|
|
Tilings and model theoryJAC 2008, Apr 2008, Uzès, France. pp.29-39 |
|
|
Amoebae for clustering: a bio-inspired cellular automata method for data classificationAutomata and Complexity, 42, Springer, Cham, pp.417-432, 2022, 978-3-030-92553-6. ⟨10.1007/978-3-030-92551-2_23⟩ |
|
|
The Undecidability of the Domino ProblemSubstitution and Tiling Dynamics: Introduction to Self-inducing Structures, 2273, pp.293-357, 2020, ⟨10.1007/978-3-030-57666-0_6⟩ |
|
|
About the Domino Problem for Subshifts on GroupsValérie Berthé; M Rigo. Sequences, Groups, and Number Theory, Birkhäuser, Cham, pp.331-389, 2018, Trends in Mathematics, 978-3-319-69151-0. ⟨10.1007/978-3-319-69152-7_9⟩ |
|
|
Surjective Cellular Automata of neighborhood size at most 62017 |
|
|
Évaluation rapide de fonctions hypergéométriques[Rapport de recherche] RT-0242, INRIA. 2000, pp.17 |
|
|
Propriétés structurelles et calculatoires des pavagesThéorie et langage formel [cs.FL]. Université Montpellier II - Sciences et Techniques du Languedoc, 2011 |