picture of me

Aleksander Mądry

I am an NBX Career Development Assistant Professor of Computer Science in the MIT EECS Department, a member of CSAIL and of the Theory of Computation group.

I received my Ph.D. from MIT in 2011. Prior to joining the MIT's faculty, I spent a year as a postdoctoral researcher at Microsoft Research New England and then I was on the faculty of EPFL until early 2015.

Research Interests: I am mainly interested in algorithmic graph theory, i.e., design and analysis of very efficient (approximation) algorithms for fundamental graph problems. I also enjoy investigating topics in combinatorial optimization - especially the ones that involve coping with uncertainty. A frequent theme in my research is employing a mix of linear-algebraic methods (particularly, the tools of spectral graph theory) and continuous optimization techniques (such as gradient descent and interior-point methods) to purely combinatorial problems.

Email: madry@mit.edu    My Curriculum Vitae

Interested in working with me? Apply to our PhD program. (Please do not email me regarding this matter - just mention my name in your application.) Also, please do not contact me regarding internship positions (unless you are an MIT student).


     Selected Papers (Show all):