( en | de | ru )

 

Disambiguation of "Yannakakis, Mihalis"

Author of the publication

copydeleteadd this publication to your clipboard
Black Box Checking.

, , and . FORTE, volume 156 of IFIP Conference Proceedings, page 225-240. Kluwer, (1999)

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

Deadlock-Freedom (and Safety) of Transactions in a Distributed Database., and . PODS, page 105-112. ACM, (1985)Node- and Edge-Deletion NP-Complete Problems. STOC, page 253-264. ACM, (1978)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)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)Recursive stochastic games with positive rewards., , and . Theor. Comput. Sci., (2019)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)Inference of Message Sequence Charts., , and . IEEE Trans. Software Eng., 29 (7): 623-633 (2003)Linear Approximation of Shortest Superstrings, , , and . J. ACM, 41 (4): 630-647 (1994)