Young Kun-Ko

Publication Activity (10 Years)

Years Active: 2014-2020
Publications (10 Years): 7

Top Topics

Nearest Neighbor

Linear Programming

Dense Subgraphs

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Young Kun-Ko, Omri Weinstein
An Adaptive Step Toward the Multiphase Conjecture. FOCS (2020)
Young Kun-Ko, Omri Weinstein
An Adaptive Step Toward the Multiphase Conjecture. CoRR (2019)
Mark Braverman, Young Kun-Ko
Information Value of Two-Prover Games. ITCS (2018)
Mark Braverman, Young Kun-Ko
Semi-Direct Sum Theorem and Nearest Neighbor under l_infty. APPROX-RANDOM (2018)
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness. SIAM J. Comput. 47 (6) (2018)
Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein
-Subgraph with Perfect Completeness. SODA (2017)
Mark Braverman, Young Kun-Ko
Information Value of Two-Prover Games. Electron. Colloquium Comput. Complex. 24 (2017)
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. CoRR (2015)
Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein
ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness. CoRR (2015)
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. Electron. Colloquium Comput. Complex. 22 (2015)
Mark Braverman, Young Kun-Ko, Omri Weinstein
-time breaks the Exponential Time Hypothesis. SODA (2015)
Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein
-Subgraph with Perfect Completeness. Electron. Colloquium Comput. Complex. 22 (2015)
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. FOCS (2015)
Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani
Linear Programming Hierarchies Suffice for Directed Steiner Tree. IPCO (2014)
Mark Braverman, Young Kun-Ko, Omri Weinstein
-time breaks the Exponential Time Hypothesis. Electron. Colloquium Comput. Complex. 21 (2014)