Amey Bhangale is an Assistant Professor in the Computer Science Department at the University of California, Riverside.

Amey got his undergraduate degree from VJTI, Mumbai. In the final year of his undergraduate studies, he met Prof. Rajiv C. Gandhi, who was visiting Mumbai in 2010/11 on a Fulbright scholarship and taught a course on approximation algorithms at VJTI. This encounter influenced Amey to pursue research in the theory of computing.

Amey graduated from Rutgers University in 2017 under the supervision of Swastik Kopparty. He spent two wonderful years in Israel where he was a post-doctoral fellow at the Weizmann Institute of Science hosted by Irit Dinur. He is interested in approximation algorithms, hardness of approximations and analysis of Boolean functions.

Prahladh Harsha is a theoretical computer scientist at the Tata Institute of Fundamental Research (TIFR). He received his B.Tech. degree in Computer Science and Engineering from the IIT Madras in 1998 and his S.M. and Ph.D. degrees in Computer Science from MIT in 2000 and 2004, respectively. Prior to joining TIFR in 2010, he was at Microsoft Research, Silicon Valley and at the Toyota Technological Institute at Chicago. His areas of interest include computational complexity, hardness of approximation, coding theory and information theory.

Girish Varma is a scientist at the Machine Learning Lab at IIIT Hyderabad. He received his B.Tech. degree in Computer Science and Engineering from the NIT Calicut in 2008 and his M.S. and Ph.D. degrees in Computer Science from the Tata Institute of Fundamental Research (TIFR), Mumbai in 2015. Prior to joining IIIT Hyderabad in 2016, he was at the Weizmann Institute of Science. His research focusses on using theoretical computer science concepts in solving applied problems in computer vision.