bibliographer - Sergei Vorobyov

bibliographer a curated TCS bibliography

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

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]

The Hardest'' Natural Decidable Theory Sergei Vorobyov [github]

An improved lower bound for the elementary theories of trees Sergei Vorobyov [github]

forallexists-Equational theory of context unification is pi10-hard Sergei Vorobyov [github]

The most nonelementary theory Sergei Vorobyov [github]

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

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

[show logs] [hide logs]