bibliographer - S. Lasota

bibliographer a curated TCS bibliography

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

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

Linear Equations with Ordered Data P. Hofman S. Lasota [github]

Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms L. Clemente S. Lasota [github]

Timed pushdown automata revisited L. Clemente S. Lasota [github]

A new always cancellation-free approach to the multilevel symbolic analysis for very large electric networks S. Lasota [github]

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

[show logs] [hide logs]