CV

Education

• Ph.D in Computer Science, Princeton University, 2018
  • Advisor : Mark Braverman
  • Thesis : Hardness amplification for two prover game and communication complexity
• B.S. in Mathematics with Honors, University of Chicago, 2013

Trivia

• Native in Korean, Fluent in English
• Can code Java, Python, JavaScript

Publications

Approximating the best Nash Equilibrium in sub quasipolytime breaks the Exponential Time Hypothesis

Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness

Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games

ETH Hardness for Densest-k-Subgraph with Perfect Completeness

Information Value of the Game

Semi-Direct Sum Theorem and Nearest Neighbor under l infinity

An Adaptive Step Toward the Multiphase Conjecture and Lower Bounds on Nonlinear Networks

Talks

Approximating the best Nash Equilibrium in sub-quasipolytime breaks the Exponential Time Hypothesis

October 24, 2014

Talk at Princeton University, Department of Computer Science, Princeton, NJ

Approximating the Best Nash Equilibrium in sub quasi polytime Breaks the Exponential Time Hypothesis

January 05, 2015

Conference proceedings talk at SODA 2015, San Diego, CA

How Exactly Hard are `Intermediately-Hard’ Problems?

August 24, 2016

Talk at China Theory Week 2016, The Chinese University of Hong Kong, Hong Kong

Tutorial on quasi-poly hardness results assuming ETH-hypothesis

November 11, 2016

Tutorial at Schloss Dagstuhl, Dagstuhl, Germany

Information Value of the Game

January 13, 2018

Conference proceedings talk at ITCS 2018, Cambridge, MA

Semi-Direct Sum Theorem and Nearest Neighbor under l infinity.

August 20, 2018

Conference proceedings talk at APPROX/RANDOM 2018, Princeton, NJ

An Adaptive Step Toward the Multiphase Conjecture

November 14, 2019

Theory Lunch Talk at NYU Theory Lunch, New York, NY

Teaching

Data Structure 2018 Fall

Data Structure 2019 Spring

Data Structure 2019 Fall

Professional Service