Pooya Hatami is a Ph.D. student in computer science at the University of Chicago, advised by Alexander Razborov. He is interested in complexity theory and combinatorics. He enjoys sports such as basketball and volleyball, arts such as photography and sculpture, and music, especially Jazz and Blues.

Raghav Kulkarni did his undergraduate studies in Mathematics at the Chennai Mathematical Institute (India). He obtained his Ph.D. in Computer Science from the University of Chicago (USA) under the supervision of Janos Simon and Alexander Razborov. The title of his thesis is “Computational Complexity: Counting, Evasiveness, and Isolation.” Currently he is a postdoc at LIAFA, Paris 7 in the “Algorithms and Complexity” group lead by Miklos Santha. The main focus of his current research is Decision-Tree Complexity.

Denis Pankratov received his Bachelor's degree from the University of Toronto. His interest in the theory of computation was sparked by Allan Borodin, who gave inspiring lectures and supervised Denis's summer research project. Currently, Denis is a Ph.D. student at the University of Chicago supervised by Laci Babai. His main research interest is in complexity theory, and in particular, in communication complexity. In his spare time, he likes to lift heavy weights at the university gym.