( en | de | ru )

 

Disambiguation of "Leroux, Jérôme"

Author of the publication

copydeleteadd this publication to your clipboard
Vector Addition Systems Reachability Problem (A Simpler Solution).

. Turing-100, volume 10 of EPiC Series in Computing, page 214-228. EasyChair, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jérôme Huppertz

Modulation inflammatorischer Prozesse mittels GPI-verankerter Chemokin-Analoga. Uni München, (2009)

Jérôme Krets

Jérôme Clerc

Jérôme Boucher

Jérôme Feret

 

Other publications of authors with the same name

Flat Counter Automata Almost Everywhere!, and . ATVA, volume 3707 of Lecture Notes in Computer Science, page 489-503. Springer, (2005)Polynomial Vector Addition Systems With States.. ICALP, volume 107 of LIPIcs, page 134:1-134:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The convex hull of a regular set of integer vectors is polyhedral and effectively computable, and . CoRR, (2008)Accelerated Data-Flow Analysis, and . CoRR, (2008)Vector Addition System Reversible Reachability Problem.. CONCUR, volume 6901 of Lecture Notes in Computer Science, page 327-341. Springer, (2011)On Functions Weakly Computable by Pushdown Petri Nets and Related Systems., , , and . CoRR, (2019)Model Checking Population Protocols., , , and . FSTTCS, volume 65 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States., , and . Petri Nets, volume 10877 of Lecture Notes in Computer Science, page 184-203. Springer, (2018)Flat Petri Nets (Invited Talk).. Petri Nets, volume 12734 of Lecture Notes in Computer Science, page 17-30. Springer, (2021)Preface., , , , and . Fundam. Informaticae, 143 (3-4): i-ii (2016)