Aleksander Mądry is an assistant professor in the EECS Department at MIT. His research centers on algorithmic graph theory and understanding uncertainty in the context of optimization. Aleksander received his PhD from MIT in 2011, and prior to joining the MIT faculty, he spent a year as a postdoctoral researcher at Microsoft Research New England, and almost three years on the faculty of EPFL. His work has been recognized with a number of awards, including a NSF CAREER Award, an Alfred P. Sloan Research Fellowship, an ACM Doctoral Dissertation Award Honorable Mention, a George M. Sprowls Doctoral Dissertation Award, and a number of best paper awards at FOCS, SODA, and STOC conferences.