Mihalis Yannakakis
Affiliations: | Computer Science | Columbia University, New York, NY |
Area:
Algorithms, Complexity Theory, Combinatorial Optimization, Databases, Testing and VerificationWebsite:
http://www.cs.columbia.edu/~mihalis/Google:
"Mihalis Yannakakis"Children
Sign in to add trainee| Spyridon Antonakopoulos | grad student | 2009 | Columbia |
| Ilias Diakonikolas | grad student | 2011 | Columbia |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Soltan S, Yannakakis M, Zussman G. (2020) Doubly Balanced Connected Graph Partitioning Acm Transactions On Algorithms. 16: 1-24 |
| Yannakakis M. (2020) Planar graphs that need four pages Journal of Combinatorial Theory, Series B. 145: 241-263 |
| Soltan S, Yannakakis M, Zussman G. (2018) Power Grid State Estimation Following a Joint Cyber and Physical Attack Ieee Transactions On Control of Network Systems. 5: 499-512 |
| Chen X, Diakonikolas I, Paparas D, et al. (2018) The complexity of optimal multidimensional pricing for a unit-demand buyer Games and Economic Behavior. 110: 139-164 |
| Etessami K, Stewart A, Yannakakis M. (2017) A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes Siam Journal On Computing. 46: 1515-1553 |
| Stewart A, Etessami K, Yannakakis M. (2015) Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata Journal of the Acm. 62 |
| Etessami K, Yannakakis M. (2015) Recursive Markov decision processes and recursive stochastic games Journal of the Acm. 62 |
| Chen X, Diakonikolas I, Orfanou A, et al. (2015) On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 1464-1479 |
| Etessami K, Stewart A, Yannakakis M. (2015) Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9135: 184-196 |
| Etessami K, Stewart A, Yannakakis M. (2014) A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing Acm Transactions On Computation Theory. 6 |