A structural completeness theorem for a class of conditional rewrite rule systems. - Sergei G. Vorobyov (Conference on Computer Logic, 1988)

On the Arithmetic Inexpressiveness of Term Rewriting Systems - Sergei G. Vorobyov (LICS, 1988)

Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. - Sergei G. Vorobyov (RTA, 1989)

Could Orders Be Captured By Term Rewriting Systems? - Sergei G. Vorobyov (CTRS, 1992)

Structural Decidable Extensions of Bounded Quantification. - Sergei G. Vorobyov (POPL, 1995)

On the Bounded Theories of Finite Frees. - Sergei G. Vorobyov (ASIAN, 1996)

An Improved Lower Bound for the Elementary Theories of Trees. - Sergei G. Vorobyov (CADE, 1996)

The "Hardest" Natural Decidable Theory. - Sergei G. Vorobyov (LICS, 1997)

The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. - Sergei G. Vorobyov (RTA, 1997)

Subtyping Functional+Nonempty Record Types. - Sergei G. Vorobyov (CSL, 1998)

forall exists*-Equational Theory of Context Unification is Pi10-Hard. - Sergei G. Vorobyov (MFCS, 1998)

Complexity of Nonrecursive Logic Programs with Complex Values. - Sergei G. Vorobyov; Andrei Voronkov (PODS, 1998)

A Randomized Subexponential Algorithm for Parity Games. - Viktor Petersson; Sergei G. Vorobyov (Nord. J. Comput., 2001)

The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems. - Sergei G. Vorobyov (Inf. Comput., 2002)

forall-Exists5-equational theory of context unification is undecidable. - Sergei G. Vorobyov (Theor. Comput. Sci., 2002)

Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework. - Henrik Björklund; Sven Sandberg; Sergei G. Vorobyov (Ershov Memorial Conference, 2003)

A Discrete Subexponential Algorithm for Parity Games. - Henrik Björklund; Sven Sandberg; Sergei G. Vorobyov (STACS, 2003)

A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. - Henrik Björklund; Sven Sandberg; Sergei G. Vorobyov (MFCS, 2004)

The most nonelementary theory. - Sergei G. Vorobyov (Inf. Comput., 2004)

Memoryless determinacy of parity and mean payoff games: a simple proof. - Henrik Björklund; Sven Sandberg; Sergei G. Vorobyov (Theor. Comput. Sci., 2004)

Combinatorial structure and randomized subexponential algorithms for infinite games. - Henrik Björklund; Sergei G. Vorobyov (Theor. Comput. Sci., 2005)

Linear Programming Polytope and Algorithm for Mean Payoff Games. - Ola Svensson; Sergei G. Vorobyov (AAIM, 2006)

Linear Complementarity and P-Matrices for Stochastic Games. - Ola Svensson; Sergei G. Vorobyov (Ershov Memorial Conference, 2006)

A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. - Henrik Björklund; Sergei G. Vorobyov (Discret. Appl. Math., 2007)

Cyclic games and linear programming. - Sergei G. Vorobyov (Discret. Appl. Math., 2008)