The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Sergei G. Vorobyov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sergei G. Vorobyov
    An Improved Lower Bound for the Elementary Theories of Trees. [Citation Graph (2, 0)][DBLP]
    CADE, 1996, pp:275-287 [Conf]
  2. Sergei G. Vorobyov
    The "Hardest" Natural Decidable Theory. [Citation Graph (1, 0)][DBLP]
    LICS, 1997, pp:294-305 [Conf]
  3. Sergei G. Vorobyov, Andrei Voronkov
    Complexity of Nonrecursive Logic Programs with Complex Values. [Citation Graph (1, 33)][DBLP]
    PODS, 1998, pp:244-253 [Conf]
  4. Ola Svensson, Sergei G. Vorobyov
    Linear Programming Polytope and Algorithm for Mean Payoff Games. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:64-78 [Conf]
  5. Sergei G. Vorobyov
    On the Bounded Theories of Finite Frees. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1996, pp:152-161 [Conf]
  6. Sergei G. Vorobyov
    A structural completeness theorem for a class of conditional rewrite rule systems. [Citation Graph (0, 0)][DBLP]
    Conference on Computer Logic, 1988, pp:313-326 [Conf]
  7. Sergei G. Vorobyov
    Subtyping Functional+Nonempty Record Types. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:283-297 [Conf]
  8. Sergei G. Vorobyov
    Could Orders Be Captured By Term Rewriting Systems? [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:315-327 [Conf]
  9. Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
    Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2003, pp:381-394 [Conf]
  10. Sergei G. Vorobyov
    On the Arithmetic Inexpressiveness of Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:212-217 [Conf]
  11. Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
    A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:673-685 [Conf]
  12. Sergei G. Vorobyov
    forall exists*-Equational Theory of Context Unification is Pi10-Hard. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:597-606 [Conf]
  13. Sergei G. Vorobyov
    Structural Decidable Extensions of Bounded Quantification. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:164-175 [Conf]
  14. Sergei G. Vorobyov
    Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:492-512 [Conf]
  15. Sergei G. Vorobyov
    The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:254-268 [Conf]
  16. Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
    A Discrete Subexponential Algorithm for Parity Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:663-674 [Conf]
  17. Henrik Björklund, Sergei G. Vorobyov
    A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:210-229 [Journal]
  18. Sergei G. Vorobyov
    The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:175, n:2, pp:182-213 [Journal]
  19. Sergei G. Vorobyov
    The most nonelementary theory. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:190, n:2, pp:196-219 [Journal]
  20. Viktor Petersson, Sergei G. Vorobyov
    A Randomized Subexponential Algorithm for Parity Games. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2001, v:8, n:3, pp:324-345 [Journal]
  21. Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
    Memoryless determinacy of parity and mean payoff games: a simple proof. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:365-378 [Journal]
  22. Henrik Björklund, Sergei G. Vorobyov
    Combinatorial structure and randomized subexponential algorithms for infinite games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:347-360 [Journal]
  23. Sergei G. Vorobyov
    forall-Exists5-equational theory of context unification is undecidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:463-479 [Journal]
  24. Ola Svensson, Sergei G. Vorobyov
    Linear Complementarity and P-Matrices for Stochastic Games. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2006, pp:409-423 [Conf]

  25. Cyclic games and linear programming. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002