Sergei G. Vorobyov
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
10
Venues
8
Active years
1988–2006
Best venue rank
A*
Where they publish
Papers
10 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2006 | AAIM | Linear Programming Polytope and Algorithm for Mean Payoff Games. | Ola Svensson, Sergei G. Vorobyov |
| 2004 | MFCS | A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. | Henrik Bjrklund, Sven Sandberg, Sergei G. Vorobyov |
| 2003 | STACS | A Discrete Subexponential Algorithm for Parity Games. | Henrik Bjrklund, Sven Sandberg, Sergei G. Vorobyov |
| 1998 | CSL | Subtyping Functional+Nonempty Record Types. | Sergei G. Vorobyov |
| 1998 | MFCS | forall exists*-Equational Theory of Context Unification is Pi | Sergei G. Vorobyov |
| 1998 | PODS | Complexity of Nonrecursive Logic Programs with Complex Values. | Sergei G. Vorobyov, Andrei Voronkov |
| 1997 | LICS | The "Hardest" Natural Decidable Theory. | Sergei G. Vorobyov |
| 1996 | CADE | An Improved Lower Bound for the Elementary Theories of Trees. | Sergei G. Vorobyov |
| 1995 | POPL | Structural Decidable Extensions of Bounded Quantification. | Sergei G. Vorobyov |
| 1988 | LICS | On the Arithmetic Inexpressiveness of Term Rewriting Systems | Sergei G. Vorobyov |