bibliographer - Michael Wehar

bibliographer a curated TCS bibliography

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

On the Complexity of Intersecting Regular, Context-Free, and Tree Languages Joseph Swernofsky Michael Wehar [github]

Shortest paths in one-counter systems Dmitry Chistikov Wojciech Czerwiński Piotr Hofman Michał Pilipczuk Michael Wehar [github]

Intersection Non-emptiness and Hardness Within Polynomial Time Mateus de Oliveira Oliveira Michael Wehar [github]

Hardness Results for Intersection Non-Emptiness Michael Wehar [github]

On the Complexity of Intersection Non-Emptiness Problems Michael Wehar [github]

Shortest paths in one-counter systems Dmitry Chistikov Wojciech Czerwiński Piotr Hofman Michał Pilipczuk Michael Wehar [github]

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

[show logs] [hide logs]