Sergei Vorobyov

Available identifiers

Publication	Date of Publication	Type
On the bounded theories of finite trees	2024-06-21	Paper
Could orders be captured by term rewriting systems?	2023-03-09	Paper
An improved lower bound for the elementary theories of trees	2019-01-15	Paper
The first-order theory of one step rewriting in linear noetherian systems is undecidable	2017-11-17	Paper
Linear Complementarity and P-Matrices for Stochastic Games	2010-02-02	Paper
Perspectives of System Informatics	2010-01-05	Paper
Cyclic games and linear programming	2008-09-10	Paper
Linear Programming Polytope and Algorithm for Mean Payoff Games	2008-01-04	Paper
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games	2007-02-19	Paper
Combinatorial structure and randomized subexponential algorithms for infinite games	2006-03-20	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Memoryless determinacy of parity and mean payoff games: a simple proof	2004-10-27	Paper
The most nonelementary theory	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4418690	2003-08-11	Paper
The undecidability of the first-order theories of one step rewriting in linear canonical systems	2003-01-14	Paper
\(\forall \exists^{5}\)-equational theory of context unification is undecidable	2002-07-31	Paper
A randomized subexponential algorithm for parity games	2002-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4263803	2000-07-09	Paper
https://portal.mardi4nfdi.de/entity/Q4218135	1998-11-11	Paper

This page was built for person: Sergei Vorobyov