Sergei G. Vorobyov

Publication Activity (10 Years)

Years Active: 1988-2008
Publications (10 Years): 0

Publications

Sergei G. Vorobyov
Cyclic games and linear programming. Discret. Appl. Math. 156 (11) (2008)
Henrik Björklund, Sergei G. Vorobyov
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discret. Appl. Math. 155 (2) (2007)
Ola Svensson, Sergei G. Vorobyov
Linear Complementarity and P-Matrices for Stochastic Games. Ershov Memorial Conference (2006)
Ola Svensson, Sergei G. Vorobyov
Linear Programming Polytope and Algorithm for Mean Payoff Games. AAIM (2006)
Henrik Björklund, Sergei G. Vorobyov
Combinatorial structure and randomized subexponential algorithms for infinite games. Theor. Comput. Sci. 349 (3) (2005)
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
Memoryless determinacy of parity and mean payoff games: a simple proof. Theor. Comput. Sci. 310 (1-3) (2004)
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. MFCS (2004)
Sergei G. Vorobyov
The most nonelementary theory. Inf. Comput. 190 (2) (2004)
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework. Ershov Memorial Conference (2003)
Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
A Discrete Subexponential Algorithm for Parity Games. STACS (2003)
Sergei G. Vorobyov
The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems. Inf. Comput. 175 (2) (2002)
Sergei G. Vorobyov
-equational theory of context unification is undecidable. Theor. Comput. Sci. 275 (1-2) (2002)
Viktor Petersson, Sergei G. Vorobyov
A Randomized Subexponential Algorithm for Parity Games. Nord. J. Comput. 8 (3) (2001)
Sergei G. Vorobyov, Andrei Voronkov
Complexity of Nonrecursive Logic Programs with Complex Values. PODS (1998)
Sergei G. Vorobyov
Subtyping Functional+Nonempty Record Types. CSL (1998)
Sergei G. Vorobyov
-Hard. MFCS (1998)
Sergei G. Vorobyov
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. RTA (1997)
Sergei G. Vorobyov
The "Hardest" Natural Decidable Theory. LICS (1997)
Sergei G. Vorobyov
An Improved Lower Bound for the Elementary Theories of Trees. CADE (1996)
Sergei G. Vorobyov
On the Bounded Theories of Finite Frees. ASIAN (1996)
Sergei G. Vorobyov
Structural Decidable Extensions of Bounded Quantification. POPL (1995)
Sergei G. Vorobyov
Could Orders Be Captured By Term Rewriting Systems? CTRS (1992)
Sergei G. Vorobyov
Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. RTA (1989)
Sergei G. Vorobyov
A structural completeness theorem for a class of conditional rewrite rule systems. Conference on Computer Logic (1988)
Sergei G. Vorobyov
On the Arithmetic Inexpressiveness of Term Rewriting Systems LICS (1988)