Young Kun-Ko

According to our database, Young Kun-Ko authored at least 16 papers between 2014 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Efficient Linearization Implies the Multiphase Conjecture.

Young Kun-Ko

Electron. Colloquium Comput. Complex., 2022

2020

Hardness of Approximate Nearest Neighbor Search under L-infinity.

Young Kun-Ko, Min Jae Song

CoRR, 2020

An Adaptive Step Toward the Multiphase Conjecture.

Young Kun-Ko, Omri Weinstein

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2018

Hardness Amplification in Two Prover Game and Communication Complexity

Young Kun-Ko

PhD thesis, 2018

Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness.

Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette

SIAM J. Comput., 2018

On Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG.

Young Kun-Ko

Electron. Colloquium Comput. Complex., 2018

Semi-Direct Sum Theorem and Nearest Neighbor under l_infty.

Mark Braverman, Young Kun-Ko

Proceedings of the Approximation, 2018

2017

Bounds for the Communication Complexity of Two-Player Approximate Correlated Equilibria.

Young Kun-Ko, Ariel Schvartzman

Electron. Colloquium Comput. Complex., 2017

Information Value of Two-Prover Games.

Mark Braverman, Young Kun-Ko

Electron. Colloquium Comput. Complex., 2017

2016

Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games.

Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015

ETH Hardness for Densest-<i>k</i>-Subgraph with Perfect Completeness.

Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein

Electron. Colloquium Comput. Complex., 2015

ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness.

Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein

CoRR, 2015

Near-Optimal Hardness Results for Signaling in Bayesian Games.

Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy

CoRR, 2015

Approximating the best Nash Equilibrium in <i>n^o</i>^{(log <i>n</i>)}-time breaks the Exponential Time Hypothesis.

Mark Braverman, Young Kun-Ko, Omri Weinstein

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Approximating the best Nash Equilibrium in n^{o(log n)}-time breaks the Exponential Time Hypothesis.

Mark Braverman, Young Kun-Ko, Omri Weinstein

Electron. Colloquium Comput. Complex., 2014

Linear Programming Hierarchies Suffice for Directed Steiner Tree.

Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani

Proceedings of the Integer Programming and Combinatorial Optimization, 2014