Sergei G. Vorobyov

Discret. Appl. Math., 2008

2007

A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Linear Complementarity and P-Matrices for Stochastic Games.

[BibT_eX]

[DOI]

Ola Svensson

Proceedings of the Perspectives of Systems Informatics, 2006

Linear Programming Polytope and Algorithm for Mean Payoff Games.

[BibT_eX]

[DOI]

Ola Svensson

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Combinatorial structure and randomized subexponential algorithms for infinite games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

The most nonelementary theory.

[BibT_eX]

[DOI]

Inf. Comput., 2004

A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

A Discrete Subexponential Algorithm for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

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

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2003

2002

forall-Exists5-equational theory of context unification is undecidable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

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

[BibT_eX]

[DOI]

Inf. Comput., 2002

2001

A Randomized Subexponential Algorithm for Parity Games.

[BibT_eX]

[DOI]

Viktor Petersson

Nord. J. Comput., 2001

1998

Complexity of Nonrecursive Logic Programs with Complex Values.

[BibT_eX]

[DOI]

Andrei Voronkov

Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

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

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Subtyping Functional+Nonempty Record Types.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997

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

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

The "Hardest" Natural Decidable Theory.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996

An Improved Lower Bound for the Elementary Theories of Trees.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

On the Bounded Theories of Finite Frees.

[BibT_eX]

[DOI]

Proceedings of the Concurrency and Parallelism, 1996

1995

Structural Decidable Extensions of Bounded Quantification.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

1992

Could Orders Be Captured By Term Rewriting Systems?

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

1989

Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

1988

On the Arithmetic Inexpressiveness of Term Rewriting Systems

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

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

[BibT_eX]

[DOI]