PhD student of Danupon Nanongkai
Theoretical Computer Science Group (TCS)
School of Computer Science and Communication (CSC)
KTH Royal Institute of Technology, Sweden
Email: @gmail or @kth
I currently work on two topics in theoretical computer science.
- Barriers in dynamic graph problems: some dynamic graph problems have resisted many attempts to improve their running time for decades. I investigate those barriers and try to either break them or prove a (conditional) lower bound explaining why it is hard to improve.
- Optimal self-adjusting binary search tree algorithms: a famous 30-year-old conjecture called "dynamic optimality conjecture" states that splay tree is an optimal binary search tree algorithm. By formulating related easier questions, solving them, and making connections to many related areas in combinatorics, I am trying to make progress in proving this conjecture.