Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sergei G. Vorobyov
2000 – 2009
- 2008
[j8]Sergei G. Vorobyov: Cyclic games and linear programming. Discrete Applied Mathematics 156(11): 2195-2231 (2008)- 2007
- [j7]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
- [c17]Ola Svensson, Sergei G. Vorobyov: Linear Programming Polytope and Algorithm for Mean Payoff Games. AAIM 2006: 64-78
- [c16]Ola Svensson, Sergei G. Vorobyov: Linear Complementarity and P-Matrices for Stochastic Games. Ershov Memorial Conference 2006: 409-423
- 2005
- [j6]Henrik Björklund, Sergei G. Vorobyov: Combinatorial structure and randomized subexponential algorithms for infinite games. Theor. Comput. Sci. 349(3): 347-360 (2005)
- 2004
- [j5]
- [j4]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)
- [c15]Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov: A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. MFCS 2004: 673-685
- 2003
- [c14]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
- [c13]Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov: A Discrete Subexponential Algorithm for Parity Games. STACS 2003: 663-674
- 2002
- [j3]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)
- [j2]Sergei G. Vorobyov: forall-Exists5-equational theory of context unification is undecidable. Theor. Comput. Sci. 275(1-2): 463-479 (2002)
- 2001
- [j1]Viktor Petersson, Sergei G. Vorobyov: A Randomized Subexponential Algorithm for Parity Games. Nord. J. Comput. 8(3): 324-345 (2001)
1990 – 1999
- 1998
- [c12]
- [c11]Sergei G. Vorobyov: forall exists*-Equational Theory of Context Unification is Pi10-Hard. MFCS 1998: 597-606
- [c10]Sergei G. Vorobyov, Andrei Voronkov: Complexity of Nonrecursive Logic Programs with Complex Values. PODS 1998: 244-253
- 1997
- [c9]
- [c8]Sergei G. Vorobyov: The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. RTA 1997: 254-268
- 1996
- [c7]
- [c6]Sergei G. Vorobyov: An Improved Lower Bound for the Elementary Theories of Trees. CADE 1996: 275-287
- 1995
- [c5]
- 1992
- [c4]
1980 – 1989
- 1989
- [c3]Sergei G. Vorobyov: Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. RTA 1989: 492-512
- 1988
- [c2]Sergei G. Vorobyov: A structural completeness theorem for a class of conditional rewrite rule systems. Conference on Computer Logic 1988: 313-326
- [c1]Sergei G. Vorobyov: On the Arithmetic Inexpressiveness of Term Rewriting Systems. LICS 1988: 212-217
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:38 CET by the dblp team