Daniel Dadush is a tenured researcher at the Centrum Wiskunde & Informatica (CWI) in Amsterdam, Netherlands. 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. 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 lives in Budapest, Hungary. He enjoys reading anything under the sun, exploring new cafés and painting.

Shachar Lovett is an associate professor at the University of California, San Diego. He received his Ph.D. from the Weizmann Institute of Science in Israel, where his advisors were Omer Reingold and Ran Raz. Before joining UC San Diego, he was a member of the Institute for Advanced Study in Princeton. His research is broadly in theoretical computer science and related mathematics, with a focus on computational complexity, randomness and pseudo-randomness, algebraic constructions, coding theory, additive combinatorics and high-dimensional geometry. Other than doing research, Shachar has a wife, three kids, one dog and three chickens, so he never has time to be bored.

Aleksandar Nikolov is an assistant professor in the Department of Computer Science at the University of Toronto. He received his Ph.D. in 2014 from Rutgers University, where his supervisor was S. Muthukrishnan, and did a postdoc with the Theory Group at Microsoft Research in Redmond. He is a Canada Research Chair in Algorithms and Privacy. He is interested in discrepancy theory, differential privacy, convex geometry and geometric algorithms.

Sasho, as he is known to his friends, was born in Varna, Bulgaria. He enjoys stand-up comedy, watching obscure artsy movies, and reading a book or The New Yorker with a cup of coffee.