Skip to Main content
Number of documents

21

Curriculum Vitæ


Journal articles6 documents

  • François Laroussinie, Antoine Meyer, Eudes Petonnet. Counting CTL. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2013, 9 (1), pp.3.1-3.34. ⟨10.2168/LMCS-9(1:3)2013⟩. ⟨hal-00790010⟩
  • Nutan Limaye, Meena Mahajan, Antoine Meyer. On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. Journal of Automata Languages and Combinatorics, Otto-von-Guericke-Universität Magdeburg, 2009, 14 (3/4), p. 211-235. ⟨hal-00681253⟩
  • Antoine Meyer. Traces of Term-Automatic Graphs. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2008, 42, p. 615-630. ⟨10.1051/ita:2008018⟩. ⟨hal-00325729⟩
  • Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani. A Logic of Reachable Patterns in Linked Data-Structures. Journal of Logic and Algebraic Programming, Elsevier, 2007, 73 (1-2), p. 111-142. ⟨10.1016/j.jlap.2006.12.001⟩. ⟨hal-00681203⟩
  • Arnaud Carayol, Antoine Meyer. Context-Sensitive Languages, Rational Graphs and Determinism. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2006, 2 (2), pp.6. ⟨10.2168/LMCS-2(2:6)2006⟩. ⟨hal-00149086⟩
  • Arnaud Carayol, Antoine Meyer. Linearly bounded infinite graphs. Acta Informatica, Springer Verlag, 2006, 43 (4), p. 265-292. ⟨10.1007/s00236-006-0022-z⟩. ⟨hal-00149109⟩

Conference papers12 documents

  • Antoine Meyer, Simon Modeste. Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes. Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Feb 2020, Lille, France. ⟨hal-03014372⟩
  • Cécile Ouvrier-Buffet, Antoine Meyer, Simon Modeste. Discrete mathematics at university level. Interfacing mathematics, computer science and arithmetic. INDRUM 2018, INDRUM Network, University of Agder, Apr 2018, Kristiansand, Norway. pp.255-264. ⟨hal-01849537⟩
  • Simon Modeste, Sylvain Beauvoir, Jonathan Chappelon, Viviane Durand-Guerrier, Nicolás León, et al.. Algorithmics in secondary school: A comparative study between Ukraine And France. CERME 10, Feb 2017, Dublin, Ireland. pp.1634-1641. ⟨hal-02398483⟩
  • François Laroussinie, Antoine Meyer, Eudes Pétonnet. Counting CTL. FoSSaCS 2010, Mar 2010, Paphos, Cyprus. pp.206-220, ⟨10.1007/978-3-642-12032-9_15⟩. ⟨hal-00681263⟩
  • François Laroussinie, Antoine Meyer, Eudes Petonnet. Counting LTL. TIME 2010, Sep 2010, Paris, France. p. 51-58, ⟨10.1109/TIME.2010.20⟩. ⟨hal-00681267⟩
  • Nutan Limaye, Meena Mahajan, Antoine Meyer. On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008, Jun 2008, Moscow, Russia. p. 240-251, ⟨10.1007/978-3-540-79709-8_25⟩. ⟨hal-00681215⟩
  • Arnaud Carayol, Matthew Hague, Antoine Meyer, Luke Ong, Olivier Serre. Winning regions of higher-order pushdown games. Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.193-204. ⟨hal-00345939⟩
  • Antoine Meyer. Traces of Term-Automatic Graphs. Mathematical Foundations of Computer Science (MFCS), Aug 2007, Cesky Krumlov, Poland. p. 489-500, ⟨10.1007/978-3-540-74456-6_44⟩. ⟨hal-00681214⟩
  • Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani. A Logic of Reachable Patterns in Linked Data-Structures. FOSSACS 2006, Mar 2006, Vienne, Austria. p. 94-110, ⟨10.1007/11690634_7⟩. ⟨hal-00149120⟩
  • Arnaud Carayol, Antoine Meyer. Linearly Bounded Infinite Graphs. MFCS 2005, Sep 2005, Gdansk, Poland. pp.180-191, ⟨10.1007/11549345_17⟩. ⟨hal-00149334⟩
  • Ahmed Bouajjani, Antoine Meyer. Symbolic Reachability Analysis of Higher-Order Context-Free Processes. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Nov 2004, Chennai, India. pp.135-147, ⟨10.1007/b104325⟩. ⟨hal-00149812⟩
  • Antoine Meyer. On Term Rewriting Systems Having a Rational Derivation. FoSSaCS 2004, Mar 2004, Barcelona, Spain. pp.378-392, ⟨10.1007/b95995⟩. ⟨hal-00149816⟩

Book sections1 document

  • Viviane Durand-Guerrier, Antoine Meyer, Simon Modeste. Didactical issues at the interface of mathematics and computer science. Proof Technology in Mathematics Research and Teaching, 2019. ⟨hal-01912885⟩

Preprints, Working Papers, ...1 document

  • Sylvie Alayrangues, Emmanuel Beffara, Sébastien Daniel, Christophe Declercq, Anne Héam, et al.. Une analyse des exercices d’algorithmique et de programmation du brevet 2017. 2018. ⟨hal-02077738v2⟩

Theses1 document

  • Antoine Meyer. Graphes infinis de présentation finie. Informatique [cs]. Université Rennes 1, 2005. Français. ⟨tel-00325707⟩