| Hardness results for signaling in bayesian zero-sum and network routing games U Bhaskar, Y Cheng, YK Ko, C Swamy Proceedings of the 2016 ACM Conference on Economics and Computation, 479-496, 2016 | 99 | 2016 |
| Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis M Braverman, YK Ko, O Weinstein Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 67 | 2014 |
| ETH Hardness for Densest-k-Subgraph with Perfect Completeness M Braverman, YK Ko, A Rubinstein, O Weinstein Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 62 | 2017 |
| Near-optimal bounds on the bounded-round quantum communication complexity of disjointness M Braverman, A Garg, YK Ko, J Mao, D Touchette SIAM Journal on Computing 47 (6), 2277-2314, 2018 | 46 | 2018 |
| Linear programming hierarchies suffice for directed steiner tree Z Friggstad, J Könemann, Y Kun-Ko, A Louis, M Shadravan, M Tulsiani International Conference on Integer Programming and Combinatorial …, 2014 | 37 | 2014 |
| An Adaptive Step Toward the Multiphase Conjecture YK Ko, O Weinstein 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 4 | 2020 |
| Bounds for the communication complexity of two-player approximate correlated equilibria YK Ko, A Schvartzman Electronic Colloquium on Computational Complexity (ECCC) 24, 71, 2017 | 3 | 2017 |
| Finding best mixture of Nash is hard Y Cheng, YK Ko Manuscript, 2017 | 3 | 2017 |
| Hardness of approximate nearest neighbor search under l-infinity YK Ko, MJ Song arXiv preprint arXiv:2011.06135, 2020 | 2 | 2020 |
| 9th Innovations in Theoretical Computer Science Conference (ITCS 2018) K Efremenko, A Garg, R Oliveira, A Wigderson, JY Cai, Z Fu, K Girstmair, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | 2 | 2018 |
| Semi-Direct Sum Theorem and Nearest Neighbor under l_infty M Braverman, YK Ko Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018 | 2 | 2018 |
| Information value of two-prover games M Braverman, YK Ko 9th Innovations in Theoretical Computer Science Conference (ITCS), 2018 | 2 | 2018 |
| Information value of the game M Braverman, YK Ko Manuscript, 2016 | 2 | 2016 |
| Approximating the best Nash equilibrium in no (log n)-time breaks the Exponential Time Hypothesis, 2014 M Braverman, YK Ko, O Weinstein ECCC TR14-092, 0 | 2 | |
| On Symmetric Parallel Repetition: Towards Equivalence of MAXCUT and UG YK Ko ECCC 25, 34, 2018 | 1 | 2018 |
| Near-optimal hardness results for signaling in bayesian games U Bhaskar, Y Cheng, YK Ko, C Swamy CoRR, abs/1512.03543, 2015 | 1 | 2015 |
| Unifying the Landscape of Super-Logarithmic Dynamic Cell-Probe Lower Bounds YK Ko arXiv preprint arXiv:2510.17717, 2025 | | 2025 |
| Lower Bounds for Linear Operators YK Ko arXiv preprint arXiv:2509.02730, 2025 | | 2025 |
| On the (Classical and Quantum) Fine-Grained Complexity of Log-Approximate CVP and Max-Cut JA Huang, YK Ko, C Wang arXiv preprint arXiv:2411.04124, 2024 | | 2024 |
| An Adaptive Step Toward the Multiphase Conjecture and Lower Bounds on Nonlinear Networks YK Ko, O Weinstein FOCS, 2020 | | 2020 |
