( en | de | ru )

 

Disambiguation of "Yannakakis, Mihalis"

Author of the publication

copydeleteadd this publication to your clipboard
Adaptive Model Checking.

, , and . TACAS, volume 2280 of Lecture Notes in Computer Science, page 357-370. Springer, (2002)

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

Smoothed complexity of local max-cut and binary max-CSP., , , , and . STOC, page 1052-1065. ACM, (2020)Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations., and . STACS, volume 3404 of Lecture Notes in Computer Science, page 340-352. Springer, (2005)Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games., and . STACS, volume 3884 of Lecture Notes in Computer Science, page 634-645. Springer, (2006)The Complexity of Multiway Cuts (Extended Abstract), , , , and . STOC, page 241-251. ACM, (1992)Homa: An Efficient Topology and Route Management Approach in SD-WAN Overlays., , , and . INFOCOM, page 2351-2360. IEEE, (2020)Smoothed Complexity of SWAP in Local Graph Partitioning., , , and . CoRR, (2023)Searching a fixed graph, , and . Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 Paderborn, Germany, July 8--12, 1996 Proceedings 23, page 280--289. Springer, (1996)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)Recursive Concurrent Stochastic Games., and . ICALP (2), volume 4052 of Lecture Notes in Computer Science, page 324-335. Springer, (2006)Automata, Probability, and Recursion.. CIAA, volume 5148 of Lecture Notes in Computer Science, page 23-32. Springer, (2008)