Fingerprint
Dive into the research topics where Young Kun Ko is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
-
An adaptive step toward the multiphase conjecture
Ko, Y. K. & Weinstein, O., Nov 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE Computer Society, p. 752-761 10 p. 9317945. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2020-November).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
Information value of two-prover games
Braverman, M. & Ko, Y. K., Jan 1 2018, 9th Innovations in Theoretical Computer Science, ITCS 2018. Karlin, A. R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 94).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
1 Link opens in a new tab Scopus citations -
Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
Braverman, M., Garg, A., Ko, Y. K. U. N., Jieming, M. A. O. & Touchette, D., 2018, In: SIAM Journal on Computing. 47, 6, p. 2277-2314 38 p.Research output: Contribution to journal › Article › peer-review
Open Access12 Link opens in a new tab Scopus citations -
Semi-Direct Sum Theorem and Nearest Neighbor under ℓ∞
Braverman, M. & Ko, Y. K., Aug 1 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018. Blais, E., Rolim, J. D. P., Steurer, D. & Jansen, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 116).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
ETH hardness for densest-k-Subgraph with perfect completeness
Braverman, M., Ko, Y. K., Rubinstein, A. & Weinstein, O., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 1326-1341 16 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access30 Link opens in a new tab Scopus citations