Mihalis Yannakakis(1953)
Mihalis Yannakakis is a recipient of the Knuth Prize (2005) from Greece. They were educated at Princeton University and National Technical University of Athens. They have been affiliated with Columbia University.
Greece
1
Major Awards
252
Publications
33,372
Citations
86
h-index
N/A
i10-index
132.4
Avg Citations/Paper
Awards & Recognition
Most Cited Works
Top publications by citation count#2
Reducing Tarski to Unique Tarski (in the Black-box Model)
Electron. Colloquium Comput. Complex.(2026)
13
citations
#3
Computational Complexity of the Hylland-Zeckhauser Mechanism for One-Sided Matching Markets
SIAM journal on computing (Print)(2025)
5
citations
#5
Computing a Fixed Point of Contraction Maps in Polynomial Queries
Electron. Colloquium Comput. Complex.(2024)
8
citations
#6
Computing a Fixed Point of Contraction Maps in Polynomial Queries
Journal of the ACM(2024)
0
citations
#7
Smoothed Complexity of SWAP in Local Graph Partitioning
ACM-SIAM Symposium on Discrete Algorithms(2023)
5
citations
#8
The Smoothed Complexity of Policy Iteration for Markov Decision Processes
Symposium on the Theory of Computing(2022)
6
citations
#9
Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP
Information Technology Convergence and Services(2022)
15
citations
#10
Center-Embedding and Constituency in the Brain and a New Characterization of Context-Free Languages
NALOMA(2022)
5
citations
Recent Publications
View all worksReducing Tarski to Unique Tarski (in the Black-box Model)
Electron. Colloquium Comput. Complex.2026
13citations
Computational Complexity of the Hylland-Zeckhauser Mechanism for One-Sided Matching Markets
SIAM journal on computing (Print)2025
5citations
The Fairness-Quality Trade-off in Clustering
Neural Information Processing Systems2024
3citations
Computing a Fixed Point of Contraction Maps in Polynomial Queries
Electron. Colloquium Comput. Complex.2024
8citations
Open AccessComputing a Fixed Point of Contraction Maps in Polynomial Queries
Journal of the ACM2024
0citations
Smoothed Complexity of SWAP in Local Graph Partitioning
ACM-SIAM Symposium on Discrete Algorithms2023
5citations
Open AccessThe Smoothed Complexity of Policy Iteration for Markov Decision Processes
Symposium on the Theory of Computing2022
6citations
Open AccessExtremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP
Information Technology Convergence and Services2022
15citations
Open AccessCenter-Embedding and Constituency in the Brain and a New Characterization of Context-Free Languages
NALOMA2022
5citations
Open AccessExternal Profiles
Education
Princeton University
National Technical University of Athens
Doctoral Advisors
Academy Memberships
National Academy of Sciences (US)American Academy of Arts and Sciences
Top Publications
REACT to Cyber Attacks on Power Grids
IEEE Transactions on Network Science and Engineering201946 citations
Computational Complexity of the Hylland–Zeckhauser Mechanism for One-Sided Matching Markets
SIAM Journal on Computing20252 citations
Computing a Fixed Point of Contraction Maps in Polynomial Queries
Proceedings of the 56th Annual ACM Symposium on Theory of Computing20241 citations
Recursive stochastic games with positive rewards
Theoretical Computer Science20191 citations
Computing a Fixed Point of Contraction Maps in Polynomial Queries
Journal of the ACM20250 citations
Related Laureates
Other winners of the same award(s)
Data Sources
Profile data aggregated from Semantic Scholar, Wikidata, ORCID, and curated award records. Citation metrics may vary between sources.