Aleksander Mądry is a doctoral candidate in MIT’s Electrical Engineering and Computer Science department, where he is developing improved algorithms for the solution of logistics problems of fundamental importance to theoretical computer science. His research focuses particularly on the challenge of traversing a network of roads in the most efficient way, where the measure of efficiency might be the shortest route or the least congested route. Aleksander is also studying variants of this problem, in which one lacks information about current road traffic or must take into account a specified probability that some parts of the network are unavailable. His other professional interests include algorithmic graph theory and combinatorial optimization.
Born and raised in Wrocław, Poland, Aleksander received a Bachelor’s degree in theoretical physics and mathematics from the University of Wrocław, where he also pursued Master’s-level studies in computer science. While a student in Poland, Alexander carried out research at the Max Planck Institute for Computer Science, at the University of Lübeck, in Germany, and at the Joint Institute for Nuclear Research, in Dubna, Russia. Upon returning to Poland, he hopes to stimulate research in theoretical computer science and to facilitate cooperation between Polish and foreign researchers.