| 2008 |
|---|
| 25 | EE | Sergei G. Vorobyov:
Cyclic games and linear programming.
Discrete Applied Mathematics 156(11): 2195-2231 (2008) |
| 2007 |
|---|
| 24 | EE | Henrik Björklund,
Sergei G. Vorobyov:
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
Discrete Applied Mathematics 155(2): 210-229 (2007) |
| 2006 |
|---|
| 23 | EE | Ola Svensson,
Sergei G. Vorobyov:
Linear Programming Polytope and Algorithm for Mean Payoff Games.
AAIM 2006: 64-78 |
| 22 | EE | Ola Svensson,
Sergei G. Vorobyov:
Linear Complementarity and P-Matrices for Stochastic Games.
Ershov Memorial Conference 2006: 409-423 |
| 2005 |
|---|
| 21 | EE | Henrik Björklund,
Sergei G. Vorobyov:
Combinatorial structure and randomized subexponential algorithms for infinite games.
Theor. Comput. Sci. 349(3): 347-360 (2005) |
| 2004 |
|---|
| 20 | EE | Henrik Björklund,
Sven Sandberg,
Sergei G. Vorobyov:
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.
MFCS 2004: 673-685 |
| 19 | EE | Sergei G. Vorobyov:
The most nonelementary theory.
Inf. Comput. 190(2): 196-219 (2004) |
| 18 | EE | 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): 365-378 (2004) |
| 2003 |
|---|
| 17 | EE | Henrik Björklund,
Sven Sandberg,
Sergei G. Vorobyov:
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework.
Ershov Memorial Conference 2003: 381-394 |
| 16 | EE | Henrik Björklund,
Sven Sandberg,
Sergei G. Vorobyov:
A Discrete Subexponential Algorithm for Parity Games.
STACS 2003: 663-674 |
| 2002 |
|---|
| 15 | EE | Sergei G. Vorobyov:
The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems.
Inf. Comput. 175(2): 182-213 (2002) |
| 14 | EE | Sergei G. Vorobyov:
forall-Exists5-equational theory of context unification is undecidable.
Theor. Comput. Sci. 275(1-2): 463-479 (2002) |
| 2001 |
|---|
| 13 | EE | Viktor Petersson,
Sergei G. Vorobyov:
A Randomized Subexponential Algorithm for Parity Games.
Nord. J. Comput. 8(3): 324-345 (2001) |
| 1998 |
|---|
| 12 | | Sergei G. Vorobyov:
Subtyping Functional+Nonempty Record Types.
CSL 1998: 283-297 |
| 11 | EE | Sergei G. Vorobyov:
forall exists*-Equational Theory of Context Unification is Pi10-Hard.
MFCS 1998: 597-606 |
| 10 | EE | Sergei G. Vorobyov,
Andrei Voronkov:
Complexity of Nonrecursive Logic Programs with Complex Values.
PODS 1998: 244-253 |
| 1997 |
|---|
| 9 | EE | Sergei G. Vorobyov:
The "Hardest" Natural Decidable Theory.
LICS 1997: 294-305 |
| 8 | | Sergei G. Vorobyov:
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable.
RTA 1997: 254-268 |
| 1996 |
|---|
| 7 | | Sergei G. Vorobyov:
On the Bounded Theories of Finite Frees.
ASIAN 1996: 152-161 |
| 6 | | Sergei G. Vorobyov:
An Improved Lower Bound for the Elementary Theories of Trees.
CADE 1996: 275-287 |
| 1995 |
|---|
| 5 | | Sergei G. Vorobyov:
Structural Decidable Extensions of Bounded Quantification.
POPL 1995: 164-175 |
| 1992 |
|---|
| 4 | | Sergei G. Vorobyov:
Could Orders Be Captured By Term Rewriting Systems?
CTRS 1992: 315-327 |
| 1989 |
|---|
| 3 | | Sergei G. Vorobyov:
Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction.
RTA 1989: 492-512 |
| 1988 |
|---|
| 2 | | Sergei G. Vorobyov:
A structural completeness theorem for a class of conditional rewrite rule systems.
Conference on Computer Logic 1988: 313-326 |
| 1 | | Sergei G. Vorobyov:
On the Arithmetic Inexpressiveness of Term Rewriting Systems
LICS 1988: 212-217 |
