Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

I study the speed with which finite Markov chains approach their stationary distribution. Recent work has focused on the analysis of two early birthday attacks on problems related to cryptography: ...

Professor Uehara from JAIST works at the intersection of theoretical computer science, discrete mathematics, and the art of solving puzzles. His research strives to understand the computational ...