( en | de | ru )

 

Disambiguation of "Vorobyov, Sergei G."

Author of the publication

copydeleteadd this publication to your clipboard
Memoryless determinacy of parity and mean payoff games: a simple proof.

, , and . Theor. Comput. Sci., 310 (1-3): 365-378 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sergei Traustel

Sergei Traustel

Sergei Sawitzki

Sergei Adichtchev

Sergei Shapiro

 

Other publications of authors with the same name

Linear Complementarity and P-Matrices for Stochastic Games., and . Ershov Memorial Conference, volume 4378 of Lecture Notes in Computer Science, page 409-423. Springer, (2006)The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable.. RTA, volume 1232 of Lecture Notes in Computer Science, page 254-268. Springer, (1997)Complexity of Nonrecursive Logic Programs with Complex Values., and . PODS, page 244-253. ACM Press, (1998)Could Orders Be Captured By Term Rewriting Systems?. CTRS, volume 656 of Lecture Notes in Computer Science, page 315-327. Springer, (1992)An Improved Lower Bound for the Elementary Theories of Trees.. CADE, volume 1104 of Lecture Notes in Computer Science, page 275-287. Springer, (1996)Structural Decidable Extensions of Bounded Quantification.. POPL, page 164-175. ACM Press, (1995)The "Hardest" Natural Decidable Theory.. LICS, page 294-305. IEEE Computer Society, (1997)Cyclic games and linear programming.. Discret. Appl. Math., 156 (11): 2195-2231 (2008)On the Bounded Theories of Finite Frees.. ASIAN, volume 1179 of Lecture Notes in Computer Science, page 152-161. Springer, (1996)Linear Programming Polytope and Algorithm for Mean Payoff Games., and . AAIM, volume 4041 of Lecture Notes in Computer Science, page 64-78. Springer, (2006)