Sergei G. Vorobyov

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