bibliographer - Marvin Kunnemann

bibliographer a curated TCS bibliography

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

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds Karl Bringmann Allan Grønlund Marvin Kunnemann Kasper Green Larsen [github]

Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve Amir Abboud Arturs Backurs Karl Bringmann Marvin Kunnemann [github]

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality Marvin Kunnemann Filip Mazowiecki Lia Schutze Henry Sinclair-Banks Karol Węgrzycki [github]

Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts Karl Bringmann Philip Wellnitz Marvin Künnemann [github]

Library Size: 13G (4 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A

[show logs] [hide logs]