default search action
Jean-Yves Moyen
Person information
- affiliation: University of Copenhagen, Denmark
- affiliation: University of Paris 13, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c12]Jean-Yves Moyen, Jakob Grue Simonsen:
Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. CiE 2021: 363-372
2010 – 2019
- 2019
- [c11]Jean-Yves Moyen, Jakob Grue Simonsen:
More Intensional Versions of Rice's Theorem. CiE 2019: 217-229 - 2018
- [c10]Hugo Férée
, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak:
Formal proof of polynomial-time complexity with quasi-interpretations. CPP 2018: 146-157 - 2017
- [c9]Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Loop Quasi-Invariant Chunk Detection. ATVA 2017: 91-108 - [c8]Jean-Yves Moyen, Jakob Grue Simonsen:
Computability in the Lattice of Equivalence Relations. DICE-FOPARA@ETAPS 2017: 38-46 - [c7]Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Loop Quasi-Invariant Chunk Motion by peeling with statement composition. DICE-FOPARA@ETAPS 2017: 47-59 - 2013
- [i2]Jean-Yves Moyen, Paolo Parisen Toldin:
A polytime complexity analyser for Probabilistic Polynomial Time over imperative stack programs. CoRR abs/1304.3249 (2013) - 2012
- [j3]Patrick Baillot, Ugo Dal Lago
On quasi-interpretations, blind abstractions and implicit complexity. Math. Struct. Comput. Sci. 22(4): 549-580 (2012) - 2011
- [j2]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
Quasi-interpretations a way to control resources. Theor. Comput. Sci. 412(25): 2776-2796 (2011)
2000 – 2009
- 2009
- [j1]Jean-Yves Moyen
Resource control graphs. ACM Trans. Comput. Log. 10(4): 29:1-29:44 (2009) - [c6]James Avery
Static Complexity Analysis of Higher Order Programs. FOPARA 2009: 84-99 - 2008
- [c5]Jean-Christophe Dubacq, Jean-Yves Moyen:
Study of the NP-completeness of the compact table problem. JAC 2008: 228-237 - 2006
- [i1]Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen:
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. CoRR abs/cs/0608030 (2006) - 2005
- [c4]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
Quasi-interpretations and Small Space Bounds. RTA 2005: 150-164 - 2001
- [c3]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
On Lexicographic Termination Ordering with Space Bound Certifications. Ershov Memorial Conference 2001: 482-493 - [c2]Jean-Yves Moyen:
System Presentation: An Analyser of Rewriting Systems Complexity. RULE@PLI 2001: 412-424 - 2000
- [c1]Jean-Yves Marion, Jean-Yves Moyen:
Efficient First Order Functional Program Interpreter with Time Bound Certifications. LPAR 2000: 25-42
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-04-25 05:59 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: