default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergei G. Vorobyov
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j8]Sergei G. Vorobyov:
Cyclic games and linear programming. Discret. Appl. Math. 156(11): 2195-2231 (2008)- 2007
- [j7]Henrik Björklund, Sergei G. Vorobyov:
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discret. Appl. Math. 155(2): 210-229 (2007) - 2006
- [c17]Ola Svensson, Sergei G. Vorobyov:
Linear Programming Polytope and Algorithm for Mean Payoff Games. AAIM 2006: 64-78 - [c16]Ola Svensson, Sergei G. Vorobyov:
Linear Complementarity and P-Matrices for Stochastic Games. Ershov Memorial Conference 2006: 409-423 - 2005
- [j6]Henrik Björklund, Sergei G. Vorobyov:
Combinatorial structure and randomized subexponential algorithms for infinite games. Theor. Comput. Sci. 349(3): 347-360 (2005) - 2004
- [j5]Sergei G. Vorobyov:
The most nonelementary theory. Inf. Comput. 190(2): 196-219 (2004) - [j4]Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov:
Memoryless determinacy of parity and mean payoff games: a simple proof. Theor. Comput. Sci. 310(1-3): 365-378 (2004) - [c15]Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov:
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. MFCS 2004: 673-685 - 2003
- [c14]Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov:
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework. Ershov Memorial Conference 2003: 381-394 - [c13]Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov:
A Discrete Subexponential Algorithm for Parity Games. STACS 2003: 663-674 - 2002
- [j3]Sergei G. Vorobyov:
The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems. Inf. Comput. 175(2): 182-213 (2002) - [j2]Sergei G. Vorobyov:
forall-Exists5-equational theory of context unification is undecidable. Theor. Comput. Sci. 275(1-2): 463-479 (2002) - 2001
- [j1]Viktor Petersson, Sergei G. Vorobyov:
A Randomized Subexponential Algorithm for Parity Games. Nord. J. Comput. 8(3): 324-345 (2001)
1990 – 1999
- 1998
- [c12]Sergei G. Vorobyov:
Subtyping Functional+Nonempty Record Types. CSL 1998: 283-297 - [c11]Sergei G. Vorobyov:
forall exists*-Equational Theory of Context Unification is Pi10-Hard. MFCS 1998: 597-606 - [c10]Sergei G. Vorobyov, Andrei Voronkov:
Complexity of Nonrecursive Logic Programs with Complex Values. PODS 1998: 244-253 - 1997
- [c9]Sergei G. Vorobyov:
The "Hardest" Natural Decidable Theory. LICS 1997: 294-305 - [c8]Sergei G. Vorobyov:
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. RTA 1997: 254-268 - 1996
- [c7]Sergei G. Vorobyov:
On the Bounded Theories of Finite Frees. ASIAN 1996: 152-161 - [c6]Sergei G. Vorobyov:
An Improved Lower Bound for the Elementary Theories of Trees. CADE 1996: 275-287 - 1995
- [c5]Sergei G. Vorobyov:
Structural Decidable Extensions of Bounded Quantification. POPL 1995: 164-175 - 1992
- [c4]Sergei G. Vorobyov:
Could Orders Be Captured By Term Rewriting Systems? CTRS 1992: 315-327
1980 – 1989
- 1989
- [c3]Sergei G. Vorobyov:
Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. RTA 1989: 492-512 - 1988
- [c2]Sergei G. Vorobyov:
A structural completeness theorem for a class of conditional rewrite rule systems. Conference on Computer Logic 1988: 313-326 - [c1]Sergei G. Vorobyov:
On the Arithmetic Inexpressiveness of Term Rewriting Systems. LICS 1988: 212-217
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
