Ko, Young Kun

1. ETH Hardness for Densest-k-Subgraph with Perfect Completeness
   2015/04/30 by Mark Braverman, Braverman, Mark, Young Kun-Ko +5 · 3 citations
   Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning and Algorithms #Machine Learning and Data Classification
2. Near-optimal bounds on bounded-round quantum communication complexity of\n disjointness
   2015/05/12 by Mark Braverman, Braverman, Mark, Ankit Garg +7 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)
3. Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing\n Games
   2015/12/11 by Umang Bhaskar, Bhaskar, Umang, Yu Cheng +5 · 1 citation
   Decision Sciences · Economics, Econometrics and Finance · #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #Economic theories and models #FOS: Computer and information sciences #Game Theory and Applications #Game Theory and Voting Systems
4. An Adaptive Step Toward the Multiphase Conjecture
   2019/10/29 by Ko, Young Kun, Weinstein, Omri · 2 citations
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences