S. Vorobyov

发表

A Discrete Subexponential Algorithm for Parity Games

Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov, 2003, STACS.

An Improved Subexponential Algorithm for Parity Games

Henrik Björklund, S. Sandberg, S. Vorobyov, 2003 .

forall exists*-Equational Theory of Context Unification is Pi10-Hard

Sergei G. Vorobyov, S. Vorobyov, 1998, MFCS.

A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games

Henrik Björklund, Sergei G. Vorobyov, Henrik Björklund, 2007, Discrete Applied Mathematics.

Randomized Subexponential Algorithms for Infinite Games

Henrik Björklund, S. Sandberg, S. Vorobyov, 2004 .

Controlled Linear Programming: Boundedness and Duality

O. Svensson, Henrik Björklund, S. Vorobyov, 2004 .

Linear Complementarity Algorithms for Mean Payoff Games

O. Svensson, Henrik Björklund, S. Vorobyov, 2005 .

A Subexponential Algorithm for a Subclass of P-Matrix Generalized Linear Complementarity Problems

O. Svensson, S. Vorobyov, 2005 .

Fast Algorithms for Monotonic Discounted Linear Programs with Two Variables per Inequality

S. Vorobyov, Daniel Andersson, 2006 .

Interior-Point Approach to Parity games

S. Vorobyov, S Vorobyov, Petersson, 2001 .

Max-planck-institut F Ur Informatik Complexity of Nonrecursive Logic Programs with Complex Values K I N F O R M a T I K We Thank

Im Stadtwald, G. Gottlob, A. Voronkov, 1997 .

Proof normalization and subject reduction in extensions of Fsub

S. Vorobyov, 1995 .

The controlled linear programming problem : DIMACS Technical Report 2004-41, September 2004

O. Svensson, Henrik Björklund, S. Vorobyov, 2005 .

On Combinatorial Structure and Algorithms for Parity Games

Henrik Björklund, Sven Sandberg, Sergei Vorobyov, 2003 .

Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial?

S. Vorobyov, E Beffara, S Vorobyov, 2001 .

The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable

Sergei G. Vorobyov, S. Vorobyov, 1997, RTA.

Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction

Sergei G. Vorobyov, S. Vorobyov, 1989, RTA.

A structural completeness theorem for a class of conditional rewrite rule systems

Sergei G. Vorobyov, S. Vorobyov, 1988, Conference on Computer Logic.

On the arithmetic inexpressiveness of term rewriting systems

Sergei G. Vorobyov, S. Vorobyov, 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

Max-planck-institut F Ur Informatik Structural Decidable Extensions of Bounded Quantiication Structural Decidable Extensions of Bounded Quantiication

P. D. Groote, S. Vorobyov, R. Amadio, 2006 .

Structural decidable extensions of bounded quantification

Sergei G. Vorobyov, S. Vorobyov, 1995, POPL '95.

Cyclic games and linear programming

Sergei G. Vorobyov, S. Vorobyov, 2008, Discret. Appl. Math..

A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games

Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov, 2007, Discret. Appl. Math..

Linear Complementarity and P-Matrices for Stochastic Games

Ola Svensson, Sergei G. Vorobyov, O. Svensson, 2006, Ershov Memorial Conference.

Linear Programming Polytope and Algorithm for Mean Payoff Games

Ola Svensson, Sergei G. Vorobyov, O. Svensson, 2006, AAIM.

Combinatorial structure and randomized subexponential algorithms for infinite games

Henrik Björklund, Sergei G. Vorobyov, Henrik Björklund, 2005, Theor. Comput. Sci..

Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework

Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov, 2003, Ershov Memorial Conference.

A Randomized Subexponential Algorithm for Parity Games

Viktor Petersson, Sergei G. Vorobyov, S. Vorobyov, 2001, Nord. J. Comput..

Memoryless determinacy of parity and mean payoff games: a simple proof

Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov, 2004, Theor. Comput. Sci..

Controlled Linear Programming for Infinite Games

Henrik Björklund, Ola Svensson, Sergei Vorobyov, 2004 .

The Controlled Linear Programming Problem

Henrik Björklund, Ola Svensson, Sergei Vorobyov, 2004 .

Memoryless Determinacy of Parity Games: A Simple Proof

Henrik Björklund, S. Sandberg, S. Vorobyov, 2002 .

The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems

Sergei G. Vorobyov, S. Vorobyov, 2002, Inf. Comput..

Could Orders Be Captured By Term Rewriting Systems?

Sergei G. Vorobyov, S. Vorobyov, 1992, CTRS.

Complexity of nonrecursive logic programs with complex values

Andrei Voronkov, Sergei G. Vorobyov, A. Voronkov, 1998, PODS.