Sergei G. Vorobyov - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2008

Cyclic games and linear programmingSergei G. Vorobyov. DAM, 156(11):2195-2231, 2008. [doi]

2007

A combinatorial strongly subexponential strategy improvement algorithm for mean payoff gamesHenrik Björklund, Sergei G. Vorobyov. DAM, 155(2):210-229, 2007. [doi]

2006

Linear Complementarity and P-Matrices for Stochastic GamesOla Svensson, Sergei G. Vorobyov. ershov 2007: 409-423 [doi]

Linear Programming Polytope and Algorithm for Mean Payoff GamesOla Svensson, Sergei G. Vorobyov. AAIM 2006: 64-78 [doi]

2005

Combinatorial structure and randomized subexponential algorithms for infinite gamesHenrik Björklund, Sergei G. Vorobyov. TCS, 349(3):347-360, 2005. [doi]

2004

Memoryless determinacy of parity and mean payoff games: a simple proofHenrik Björklund, Sven Sandberg, Sergei G. Vorobyov. TCS, 310(1-3):365-378, 2004. [doi]

A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff GamesHenrik Björklund, Sven Sandberg, Sergei G. Vorobyov. mfcs 2004: 673-685 [doi]

The most nonelementary theorySergei G. Vorobyov. iandc, 190(2):196-219, 2004. [doi]

2003

Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean FrameworkHenrik Björklund, Sven Sandberg, Sergei G. Vorobyov. ershov 2003: 381-394 [doi]

A Discrete Subexponential Algorithm for Parity GamesHenrik Björklund, Sven Sandberg, Sergei G. Vorobyov. STACS 2003: 663-674 [doi]

2002

The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical SystemsSergei G. Vorobyov. iandc, 175(2):182-213, 2002. [doi]

forall-Exists:::5:::-equational theory of context unification is undecidableSergei G. Vorobyov. TCS, 275(1-2):463-479, 2002. [doi]

2001

A Randomized Subexponential Algorithm for Parity GamesViktor Petersson, Sergei G. Vorobyov. njc, 8(3):324-345, 2001. [doi]

1998

Subtyping Functional+Nonempty Record TypesSergei G. Vorobyov. csl 1999: 283-297

forall exists*-Equational Theory of Context Unification is Pi::1:::::0:::-HardSergei G. Vorobyov. mfcs 1998: 597-606 [doi]

Complexity of Nonrecursive Logic Programs with Complex ValuesSergei G. Vorobyov, Andrei Voronkov. PODS 1998: 244-253 [doi]

1997

The Hardest Natural Decidable TheorySergei G. Vorobyov. lics 1997: 294-305 [doi]

The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is UndecidableSergei G. Vorobyov. RTA 1997: 254-268

1996

On the Bounded Theories of Finite FreesSergei G. Vorobyov. asian 1996: 152-161

An Improved Lower Bound for the Elementary Theories of TreesSergei G. Vorobyov. cade 1996: 275-287

1995

Structural Decidable Extensions of Bounded QuantificationSergei G. Vorobyov. POPL 1995: 164-175

1992

Could Orders Be Captured By Term Rewriting Systems?Sergei G. Vorobyov. ctrs 1993: 315-327

1989

Conditional Rewrite Rule Systems with Built-In Arithmetic and InductionSergei G. Vorobyov. RTA 1989: 492-512

1988

A structural completeness theorem for a class of conditional rewrite rule systemsSergei G. Vorobyov. jic 1990: 313-326

On the Arithmetic Inexpressiveness of Term Rewriting SystemsSergei G. Vorobyov. lics 1988: 212-217

Sign in or sign up to see more results.

runs on WebDSL