bibliographer - Martin Furer

bibliographer a curated TCS bibliography

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

The Tight Deterministic Time Hierarchy Martin Furer [github]

The complexity of the inequivalence problem for regular expressions with intersection Martin Fürer [github]

On the Combinatorial Power of the Weisfeiler-Lehman Algorithm Martin Fürer [github]

An optimal lower bound on the number of variables for graph identification Jin-Yi Cai Martin Fürer Neil Immerman [github]

Faster Integer Multiplication Martin Fürer [github]

Normal forms for trivalent graphs and graphs of bounded valence Martin Fürer Walter Schnyder Ernst Specker [github]

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

[show logs] [hide logs]