default search action
Antoine Meyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Saibal De, Hemanth Kolla, Antoine Meyer, Eric T. Phipps, Francesco Rizzi:
Hybrid Parallel Tucker Decomposition of Streaming Data. PASC 2024: 20:1-20:12
2010 – 2019
- 2012
- [j6]François Laroussinie, Antoine Meyer, Eudes Petonnet:
Counting CTL. Log. Methods Comput. Sci. 9(1) (2012) - 2010
- [c9]François Laroussinie, Antoine Meyer, Eudes Petonnet:
Counting CTL. FoSSaCS 2010: 206-220 - [c8]François Laroussinie, Antoine Meyer, Eudes Petonnet:
Counting LTL. TIME 2010: 51-58
2000 – 2009
- 2009
- [j5]Nutan Limaye, Meena Mahajan, Antoine Meyer:
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. J. Autom. Lang. Comb. 14(3/4): 211-235 (2009) - 2008
- [j4]Antoine Meyer:
Traces of term-automatic graphs. RAIRO Theor. Informatics Appl. 42(3): 615-630 (2008) - [c7]Nutan Limaye, Meena Mahajan, Antoine Meyer:
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008: 240-251 - [c6]Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre:
Winning Regions of Higher-Order Pushdown Games. LICS 2008: 193-204 - 2007
- [j3]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
A logic of reachable patterns in linked data-structures. J. Log. Algebraic Methods Program. 73(1-2): 111-142 (2007) - [c5]Antoine Meyer:
Traces of Term-Automatic Graphs. MFCS 2007: 489-500 - [i5]Arnaud Carayol, Antoine Meyer:
Linearly bounded infinite graphs. CoRR abs/0705.3487 (2007) - [i4]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures. CoRR abs/0705.3610 (2007) - [i3]Ahmed Bouajjani, Antoine Meyer:
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. CoRR abs/0705.3888 (2007) - [i2]Antoine Meyer:
On Term Rewriting Systems Having a Rational Derivation. CoRR abs/0705.4064 (2007) - 2006
- [j2]Arnaud Carayol, Antoine Meyer:
Linearly bounded infinite graphs. Acta Informatica 43(4): 265-292 (2006) - [j1]Arnaud Carayol, Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism. Log. Methods Comput. Sci. 2(2) (2006) - [c4]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS 2006: 94-110 - [i1]Arnaud Carayol, Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism. CoRR abs/cs/0606053 (2006) - 2005
- [b1]Antoine Meyer:
Graphes infinis de présentation finie. (Finitely Presented Infinite Graphs). University of Rennes 1, France, 2005 - [c3]Arnaud Carayol, Antoine Meyer:
Linearly Bounded Infinite Graphs. MFCS 2005: 180-191 - 2004
- [c2]Antoine Meyer:
On Term Rewriting Systems Having a Rational Derivation. FoSSaCS 2004: 378-392 - [c1]Ahmed Bouajjani, Antoine Meyer:
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. FSTTCS 2004: 135-147
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-05-19 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint