default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmmanuel Jeandel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova:
Addition and Differentiation of ZX-diagrams. Log. Methods Comput. Sci. 20(2) (2024)- 2023
- [c29]Liliane-Joy Dandy, Emmanuel Jeandel, Vladimir Zamdzhiev:
Type-safe Quantum Programming in Idris. ESOP 2023: 507-534 - 2022
- [c28]Amaury Saint-Jore
, Nazim Fatès, Emmanuel Jeandel:
Amoebae for Clustering: A Bio-Inspired Cellular Automata Method for Data Classification. Automata and Complexity 2022: 417-432 - [c27]Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova:
Addition and Differentiation of ZX-Diagrams. FSCD 2022: 13:1-13:19 - 2021
- [c26]Emmanuel Hainry, Emmanuel Jeandel, Romain Péchoux, Olivier Zeyen:
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs. ICTAC 2021: 357-365 - [i25]Emmanuel Jeandel:
Strong shift equivalence as a category notion. CoRR abs/2107.10734 (2021) - [i24]Liliane-Joy Dandy, Emmanuel Jeandel, Vladimir Zamdzhiev:
Qimaera: Type-safe (Variational) Quantum Programming in Idris. CoRR abs/2111.10867 (2021) - 2020
- [j11]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of the ZX-Calculus. Log. Methods Comput. Sci. 16(2) (2020) - [j10]Emmanuel Jeandel, Etienne Moutot, Pascal Vanier:
Slopes of Multidimensional Subshifts. Theory Comput. Syst. 64(1): 35-61 (2020) - [c25]Titouan Carette, Emmanuel Jeandel:
A Recipe for Quantum Graphical Languages. ICALP 2020: 118:1-118:17 - [i23]Titouan Carette, Emmanuel Jeandel:
On a recipe for quantum graphical languages. CoRR abs/2008.04193 (2020)
2010 – 2019
- 2019
- [c24]Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier:
Undecidable Word Problem in Subshift Automorphism Groups. CSR 2019: 180-190 - [c23]Titouan Carette, Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of Graphical Languages for Mixed States Quantum Mechanics. ICALP 2019: 108:1-108:15 - [c22]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness. LICS 2019: 1-10 - [c21]Emmanuel Jeandel, Pascal Vanier:
A Characterization of Subshifts with Computable Language. STACS 2019: 40:1-40:16 - [i22]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of the ZX-Calculus. CoRR abs/1903.06035 (2019) - 2018
- [c20]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics. LICS 2018: 559-568 - [c19]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics. LICS 2018: 569-578 - [i21]Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier:
Undecidable word problem in subshift automorphism groups. CoRR abs/1808.09194 (2018) - [i20]Emmanuel Jeandel:
The rational fragment of the ZX-calculus. CoRR abs/1810.05377 (2018) - 2017
- [c18]Emmanuel Jeandel:
Enumeration reducibility in closure spaces with applications to logic and algebra. LICS 2017: 1-11 - [c17]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang:
ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics. MFCS 2017: 11:1-11:13 - [c16]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Y-Calculus: A language for real Matrices derived from the ZX-Calculus. QPL 2017: 23-57 - [i19]Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang:
Generalised Supplementarity and new rule for Empty Diagrams to Make the ZX-Calculus More Expressive. CoRR abs/1702.01945 (2017) - 2016
- [c15]Emmanuel Jeandel:
Computability in Symbolic Dynamics. CiE 2016: 124-131 - 2015
- [j9]Emmanuel Jeandel, Pascal Vanier:
Hardness of conjugacy, embedding and factorization of multidimensional subshifts. J. Comput. Syst. Sci. 81(8): 1648-1664 (2015) - [i18]Pierre Guillon, Emmanuel Jeandel:
Infinite Communication Complexity. CoRR abs/1501.05814 (2015) - [i17]Emmanuel Jeandel:
Some Notes about Subshifts on Groups. CoRR abs/1501.06831 (2015) - [i16]Emmanuel Jeandel:
Enumeration in Closure Spaces with Applications to Algebra. CoRR abs/1505.07578 (2015) - [i15]Emmanuel Jeandel, Michaël Rao:
An aperiodic set of 11 Wang tiles. CoRR abs/1506.06492 (2015) - [i14]Emmanuel Jeandel:
Translation-like Actions and Aperiodic Subshifts on Groups. CoRR abs/1508.06419 (2015) - [i13]Emmanuel Jeandel:
Aperiodic Subshifts on Polycyclic Groups. CoRR abs/1510.02360 (2015) - 2014
- [c14]Emmanuel Jeandel:
Computability of the entropy of one-tape Turing machines. STACS 2014: 421-432 - 2013
- [j8]Emmanuel Jeandel, Guillaume Theyssier:
Subshifts as models for MSO logic. Inf. Comput. 225: 1-15 (2013) - [j7]Emmanuel Jeandel, Pascal Vanier:
Turing degrees of multidimensional SFTs. Theor. Comput. Sci. 505: 81-92 (2013) - [c13]Emmanuel Jeandel, Pascal Vanier:
Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type. STACS 2013: 490-501 - [i12]Emmanuel Jeandel:
Computability of the entropy of one-tape Turing Machines. CoRR abs/1302.1170 (2013) - [i11]Emmanuel Jeandel, Pascal Vanier:
Characterizations of periods of multidimensional shifts. CoRR abs/1303.2462 (2013) - [i10]Alexis Ballier, Emmanuel Jeandel:
Structuring multi-dimensional subshifts. CoRR abs/1309.6289 (2013) - 2012
- [c12]Emmanuel Jeandel:
On Immortal Configurations in Turing Machines. CiE 2012: 334-343 - [c11]Emmanuel Jeandel, Nicolas Rolin:
Fixed Parameter Undecidability for Wang Tilesets. AUTOMATA & JAC 2012: 69-85 - [i9]Emmanuel Jeandel, Pascal Vanier:
Hardness of conjugacy and factorization of multidimensional subshifts of finite type. CoRR abs/1204.4988 (2012) - 2011
- [b1]Emmanuel Jeandel:
Propriétés structurelles et calculatoires des pavages. (Structural and computational properties of tilings). Montpellier 2 University, France, 2011 - [c10]Emmanuel Jeandel, Pascal Vanier:
P01\it \Pi^0_1 Sets and Tilings. TAMC 2011: 230-239 - [i8]Emmanuel Jeandel, Pascal Vanier:
Pi01 sets and tilings. CoRR abs/1102.1189 (2011) - [i7]Emmanuel Jeandel, Pascal Vanier:
Turing degrees of multidimensional SFTs. CoRR abs/1108.1012 (2011) - 2010
- [j6]Emmanuel Jeandel:
The periodic domino problem revisited. Theor. Comput. Sci. 411(44-46): 4010-4016 (2010) - [c9]Emmanuel Jeandel, Pascal Vanier:
Periodicity in Tilings. Developments in Language Theory 2010: 243-254 - [c8]Alexis Ballier, Emmanuel Jeandel:
Computing (or not) Quasi-periodicity Functions of Tilings. JAC 2010: 54-64 - [c7]Emmanuel Jeandel, Pascal Vanier:
Slopes of Tilings. JAC 2010: 145-155 - [c6]Alexis Ballier, Bruno Durand, Emmanuel Jeandel:
Tilings Robust to Errors. LATIN 2010: 480-491 - [i6]Alexis Ballier, Emmanuel Jeandel:
Computing (or not) Quasi-Periodicity Functions of Tilings. CoRR abs/1012.1222 (2010) - [i5]Emmanuel Jeandel, Pascal Vanier:
Slopes of Tilings. CoRR abs/1012.1330 (2010)
2000 – 2009
- 2009
- [c5]Emmanuel Jeandel, Guillaume Theyssier:
Subshifts, Languages and Logic. Developments in Language Theory 2009: 288-299 - [i4]Emmanuel Jeandel, Guillaume Theyssier:
Subshifts, Languages and Logic. CoRR abs/0904.2457 (2009) - [i3]Emmanuel Jeandel, Pascal Vanier:
Periodicity in tilings. CoRR abs/0909.3997 (2009) - [i2]Emmanuel Jeandel, Guillaume Theyssier:
Subshifts and Logic: Back and Forth. CoRR abs/0912.1272 (2009) - 2008
- [j5]Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé:
Finding a vector orthogonal to roughly half a collection of vectors. J. Complex. 24(1): 39-53 (2008) - [j4]Emmanuel Jeandel, Nicolas Ollinger:
Playing with Conway's problem. Theor. Comput. Sci. 409(3): 557-564 (2008) - [c4]Alexis Ballier, Emmanuel Jeandel:
Tilings and model theory. JAC 2008: 29-39 - [c3]Alexis Ballier, Bruno Durand, Emmanuel Jeandel:
Structural aspects of tilings. STACS 2008: 61-72 - [i1]Alexis Ballier, Bruno Durand, Emmanuel Jeandel:
Structural aspects of tilings. CoRR abs/0802.2828 (2008) - 2007
- [j3]Emmanuel Jeandel:
Topological Automata. Theory Comput. Syst. 40(4): 397-407 (2007) - 2005
- [j2]Harm Derksen, Emmanuel Jeandel, Pascal Koiran:
Quantum automata and algebraic groups. J. Symb. Comput. 39(3-4): 357-371 (2005) - [j1]Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier:
Decidable and Undecidable Problems about Quantum Automata. SIAM J. Comput. 34(6): 1464-1473 (2005) - [c2]Emmanuel Jeandel:
Topological Automata. STACS 2005: 389-398 - 2004
- [c1]Emmanuel Jeandel:
Universality in Quantum Computation. ICALP 2004: 793-804
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-11 20:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
