Daniel Dadush is a tenure track 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 level. He enjoys reading the New York Times, listening to NPR, and taking long bike rides through the canals when its not raining.

Gábor Kun works at the Rényi Institute in Budapest. He earned his Ph.D. at Eötvös University, Budapest, where his advisor was Csaba Szabó. This makes him László Babai's mathematical great-grandchild. In his thesis he studied constraint satisfaction problems in terms of logic; he derandomized the reduction that led Feder and Vardi to the CSP dichotomy conjecture. He was a postdoc at DIMACS, the Institute for Advanced Study, and Simon Fraser University and held visiting positions at Charles University (Prague), the Courant Institute, the University of Cambridge, and the University of Memphis. In his spare time he likes to do sports: bridge, soccer, hiking, swimming, and especially chess.