bibliographer - J. Leroux

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems J. Leroux M. Praveen Ph. Schnoebelen G. Sutre [github]

Occam's Razor Applied to the Petri Net Coverability Problem T. Geffroy J. Leroux G. Sutre [github]

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract) W. Czerwinski S. Lasota R. Lazic J. Leroux F. Mazowiecki [github]

Decomposition of Decidable First-Order Logics over Integers and Reals F. Bouchy A. Finkel J. Leroux [github]

Demystifying Reachability in Vector Addition Systems J. Leroux S. Schmitz [github]

Presburger Vector Addition Systems J. Leroux [github]

A polynomial time Presburger criterion and synthesis for number decision diagrams J. Leroux [github]

Library Size: 13G (7 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]