معرفی
Young Kun Ko is an Assistant Professor (tenure-track) at Penn State University's Department of Computer Science, part of the College of Engineering. He previously held a Faculty Fellowship (post-doc) at New York University and earned his Ph.D. in Computer Science from Princeton University under Mark Braverman, with a thesis on hardness amplification in communication complexity. His B.S. in Mathematics with Honors was completed at the University of Chicago in 2013.
His research focuses on applying information theory to complexity theory, particularly data structure lower bounds via communication complexity techniques. Key areas include algorithmic game theory (Nash equilibria), quantum communication complexity, and hardness results for problems like Densest-k-Subgraph and Multiphase Conjecture.
He teaches Data Structure courses at Penn State (2018–2019) and has presented talks on topics such as quasi-polynomial hardness under ETH, semi-direct sum theorems, and signaling in Bayesian games. No scientific awards are explicitly mentioned, though his work has been featured in venues like ITCS, APPROX/RANDOM, and SODA.
His research involves collaboration with institutions like NYU and Princeton, and his work on lower bounds has implications for dynamic data structures and approximation algorithms. He codes in Java, Python, and JavaScript and is native in Korean with fluency in English.
