Mihalis Yannakakis
Columbia University in the City of New York
H-index: 94
North America-United States
Top articles of Mihalis Yannakakis
Computing a Fixed Point of Contraction Maps in Polynomial Queries
arXiv preprint arXiv:2403.19911
2024/3/29
Smoothed Complexity of SWAP in Local Graph Partitioning
2024
The Smoothed Complexity of Policy Iteration for Markov Decision Processes
2023/6/2
Mihalis Yannakakis
H-Index: 46
Reducing tarski to unique tarski (in the black-box model)
2023
Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP
arXiv preprint arXiv:2209.07625
2022/9/15
Mihalis Yannakakis
H-Index: 46
Christos Papadimitriou
H-Index: 25
Center-embedding and constituency in the brain and a new characterization of context-free languages
arXiv preprint arXiv:2206.13217
2022/6/27
Mihalis Yannakakis
H-Index: 46
Christos H Papadimitriou
H-Index: 56
Technical Perspective: Structure and Complexity of Bag Consistency
ACM SIGMOD Record
2022/6/1
Mihalis Yannakakis
H-Index: 46
On the complexity of optimal lottery pricing and randomized mechanisms for a unit-demand buyer
SIAM Journal on Computing
2022
Computational Hardness of the Hylland-Zeckhauser Scheme∗
2022
The Platform Design Problem
2021/12/14
Epinoia: Intent checker for stateful networks
2021/7/19
Huazhe Wang
H-Index: 5
Puneet Sharma
H-Index: 2
Faraz Ahmed
H-Index: 2
Chen Qian
H-Index: 2
Mihalis Yannakakis
H-Index: 46
Planar graphs that need four pages
Journal of Combinatorial Theory, Series B
2020/11/1
Mihalis Yannakakis
H-Index: 46
Homa: An efficient topology and route management approach in SD-WAN overlays
2020/7/6
Smoothed complexity of local Max-Cut and binary Max-CSP
2020/6/22
Computational complexity of the Hylland-Zeckhauser scheme for one-sided matching markets
arXiv preprint arXiv:2004.01348
2020/4/3
Mihalis Yannakakis
H-Index: 46
Doubly balanced connected graph partitioning
ACM Transactions on Algorithms (TALG)
2020/3/5
Mihalis Yannakakis
H-Index: 46
Gil Zussman
H-Index: 29
