Journal Articles
- Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao and Dave Touchette, 2018, "Near-optimal bounds on bounded-round quantum communication complexity of disjointness", SIAM Journal of Computing special issue on FOCS 2015
Conference Proceedings
- Mark Braverman, Young Kun Ko, Aviad Rubinstein and Omri Weinstein, 2017, "ETH Hardness for Densest-k-subgraph with Perfect Completeness", SODA 2017
- Mark Braverman, Young Kun Ko and Omri Weinstein, 2015, "Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis", SODA 2015
- Young Kun Ko and Mark Braverman, , "Information Value of the Game", Innovations in Theoretical Computer Science
- Young Kun Ko and Mark Braverman, , "Semi-Direct Sum Theorem and Nearest Neighbor under l8", APPROX-RANDOM
- Young Kun Ko and Omri Weinstein, , "An Adaptive Step Toward the Multiphase Conjecture"
