Nikhil Bansal is a researcher at the Centrum voor Wiskunde en Informatica, Amsterdam. He attended the Indian Institute of Technology, Mumbai for his B. Tech. degree, and received his Ph.D. from Carnegie Mellon University, where he was advised by Avrim Blum. He got fascinated by algorithms while taking an undergraduate course by Prof. Ajit A. Diwan. Since then he has enjoyed thinking about various kinds of algorithmic questions.

Daniel Dadush is a tenured researcher at the Centrum voor Wiskunde en Informatica, Amsterdam. He earned his Ph.D. in algorithms, combinatorics and optimization (ACO) from Georgia Tech in 2012, where his advisor was Santosh Vempala. Before joining CWI, he spent two years as a Simons postdoctoral fellow in the Computer Science Department at New York University. His research has focused on algorithms for lattice problems, integer programming, and high-dimensional convex geometry. He lives and works in Amsterdam, and is glad that, thus far, the city remains above water level. He enjoys reading the New York Times, listening to NPR, and taking long bike rides along the canals when it is not raining.

Shashwat Garg is a Quantitative Researcher at WorldQuant LLC. He got his Ph.D. in algorithms from Eindhoven University of Technology in 2019 where his advisor was Nikhil Bansal. His research focused on algorithms for combinatorial discrepancy and approximation algorithms for scheduling problems. He enjoys reading anything under the sun, exploring new cafés and painting.

Shachar Lovett graduated from the Weizmann Institute of Science in 2010; his advisors were Omer Reingold and Ran Raz. He was a member of the Institute for Advanced Study, School of Mathematics between 2010-2012. Since then, he has been a faculty member at the University of California, San Diego. He is interested in the role that structure and randomness play in computation and mathematics, and in particular in computational complexity, coding theory, pseudorandomness, and algebraic constructions.