bibliographer - Henrik Björklund

bibliographer a curated TCS bibliography

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

Shuffled languages-Representation and recognition Martin Berglund Henrik Björklund Johanna Björklund [github]

The tractability frontier for NFA minimization Henrik Bjørklund Wim Martens [github]

Recognizing Shuffled Languages Martin Berglund Henrik Bjørklund Johanna Høgberg [github]

Validity of Tree Pattern Queries with Respect to Schema Information Henrik Bjørklund Wim Martens Thomas Schwentick [github]

Shuffle Expressions and Words with Nested Data Henrik Bjørklund Mikołaj Bojańczyk [github]

The Tractability Frontier for NFA Minimization Henrik Bjørklund Wim Martens [github]

A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games Henrik Bjørklund Sergei Vorobyov [github]

Memoryless determinacy of parity and mean payoff games: a simple proof Henrik Bjørklund Sven Sandberg Sergei Vorobyov [github]

Conjunctive query containment over trees Henrik Björklund Wim Martens Thomas Schwentick [github]

Combinatorial structure and randomized subexponential algorithms for infinite games Henrik Björklund Sergei Vorobyov [github]

On notions of regularity for data languages Henrik Björklund Thomas Schwentick [github]

On optimum left-to-right strategies for active context-free games Henrik Björklund Martin Schuster Thomas Schwentick Joscha Kulbatzki [github]

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

[show logs] [hide logs]