( en | de | ru )

 

Disambiguation of "Yannakakis, Mihalis"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Multiway Cuts (Extended Abstract)

, , , , and . STOC, page 241-251. ACM, (1992)

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.

Mihalis Nicolaou

 

Other publications of authors with the same name

Automata, Probability, and Recursion.. CIAA, volume 5148 of Lecture Notes in Computer Science, page 23-32. Springer, (2008)Computation of Least Fixed Points.. MFCS, volume 7464 of Lecture Notes in Computer Science, page 63. Springer, (2012)The complexity of non-monotone markets., , and . STOC, page 181-190. ACM, (2013)Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities., and . ICS, page 156-165. Tsinghua University Press, (2010)Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria., , , and . ITCS, volume 151 of LIPIcs, page 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Complexity of Reliable Concurrency Control., and . SIAM J. Comput., 16 (3): 538-553 (1987)Inference of Message Sequence Charts., , and . IEEE Trans. Software Eng., 29 (7): 623-633 (2003)Probability and Recursion., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 2-4. Springer, (2005)Recursive Concurrent Stochastic Games., and . ICALP (2), volume 4052 of Lecture Notes in Computer Science, page 324-335. Springer, (2006)The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract)., and . ICALP, volume 71 of Lecture Notes in Computer Science, page 460-470. Springer, (1979)