On Term Rewriting Systems Having a Rational Derivation. - Antoine Meyer (FoSSaCS, 2004)

Symbolic Reachability Analysis of Higher-Order Context-Free Processes. - Ahmed Bouajjani; Antoine Meyer (FSTTCS, 2004)

Graphes infinis de présentation finie. (Finitely Presented Infinite Graphs). - Antoine Meyer (2005)

Linearly bounded infinite graphs. - Arnaud Carayol; Antoine Meyer (Acta Informatica, 2006)

Context-Sensitive Languages, Rational Graphs and Determinism. - Arnaud Carayol; Antoine Meyer (Log. Methods Comput. Sci., 2006)

A logic of reachable patterns in linked data-structures. - Greta Yorsh; Alexander Moshe Rabinovich; Mooly Sagiv; Antoine Meyer; Ahmed Bouajjani (J. Log. Algebraic Methods Program., 2007)

Winning Regions of Higher-Order Pushdown Games. - Arnaud Carayol; Matthew Hague; Antoine Meyer; C.-H. Luke Ong; Olivier Serre (LICS, 2008)

Traces of term-automatic graphs. - Antoine Meyer (RAIRO Theor. Informatics Appl., 2008)

On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. - Nutan Limaye; Meena Mahajan; Antoine Meyer (J. Autom. Lang. Comb., 2009)

Counting LTL. - François Laroussinie; Antoine Meyer; Eudes Petonnet (TIME, 2010)

Counting CTL - François Laroussinie; Antoine Meyer; Eudes Petonnet (Log. Methods Comput. Sci., 2012)

Hybrid Parallel Tucker Decomposition of Streaming Data. - Saibal De; Hemanth Kolla; Antoine Meyer; Eric T. Phipps; Francesco Rizzi (PASC, 2024)