Aleksandrs Belovs
Assistant Professor, University of Latvia
Aleksandrs Belovs's main area of research is in quantum algorithms: upper and lower bounds on quantum complexity of various problems, applications of the adversary method, and discrete quantum walks. He is also interested in various aspects of theoretical computer science with an emphasis on models of computation, query complexity, lower bounds, and related mathematical techniques.