bibliographer - Karl Bringmann

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]

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

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

[show logs] [hide logs]