Young Kun-Ko

22 papers A* 5A 1B 1Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2022 J jnl
Efficient Linearization Implies the Multiphase Conjecture.
Electron. Colloquium Comput. Complex.
Young Kun-Ko
2020 A* conf
An Adaptive Step Toward the Multiphase Conjecture.
FOCS
Young Kun-Ko, Omri Weinstein
2020 J jnl
Hardness of Approximate Nearest Neighbor Search under L-infinity.
CoRR
Young Kun-Ko, Min Jae Song
2019 J jnl
An Adaptive Step Toward the Multiphase Conjecture.
CoRR
Young Kun-Ko, Omri Weinstein
2018 — —
Hardness Amplification in Two Prover Game and Communication Complexity
Young Kun-Ko
2018 A conf
Information Value of Two-Prover Games.
ITCS
Mark Braverman, Young Kun-Ko
2018 J jnl
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness.
SIAM J. Comput.
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
2018 J jnl
On Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG.
Electron. Colloquium Comput. Complex.
Young Kun-Ko
2018 — conf
Semi-Direct Sum Theorem and Nearest Neighbor under l_infty.
APPROX-RANDOM
Mark Braverman, Young Kun-Ko
2017 J jnl
Bounds for the Communication Complexity of Two-Player Approximate Correlated Equilibria.
Electron. Colloquium Comput. Complex.
Young Kun-Ko, Ariel Schvartzman
2017 A* conf
ETH Hardness for Densest-
SODA
Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein
2017 J jnl
Information Value of Two-Prover Games.
Electron. Colloquium Comput. Complex.
Mark Braverman, Young Kun-Ko
2016 A* conf
Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games.
EC
Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy
2015 A* conf
Approximating the best Nash Equilibrium in
SODA
Mark Braverman, Young Kun-Ko, Omri Weinstein
2015 J jnl
ETH Hardness for Densest-
Electron. Colloquium Comput. Complex.
Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein
2015 J jnl
ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness.
CoRR
Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein
2015 A* conf
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness.
FOCS
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
2015 J jnl
Near-Optimal Hardness Results for Signaling in Bayesian Games.
CoRR
Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy
2015 J jnl
Near-optimal bounds on bounded-round quantum communication complexity of disjointness.
CoRR
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
2015 J jnl
Near-optimal bounds on bounded-round quantum communication complexity of disjointness.
Electron. Colloquium Comput. Complex.
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
2014 J jnl
Approximating the best Nash Equilibrium in n
Electron. Colloquium Comput. Complex.
Mark Braverman, Young Kun-Ko, Omri Weinstein
2014 B conf
Linear Programming Hierarchies Suffice for Directed Steiner Tree.
IPCO
Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani