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: My research aims to identify and tackle key algorithmic challenges in today's computing. My goal is to develop theoretical ideas and tools that, ultimately, will change the way we approach optimization -- in all shapes and forms, both in theory and in practice. So far, my work revolved around two broad topics: algorithmic graph theory, and coping with uncertainty in the context of optimization. But I am always interested in exploring new topics, especially if they touch on some fundamental aspect of optimization. A recurrent theme in my research is combining the traditional, mostly combinatorial in nature, algorithmic toolkit with a variety of continuous optimization techniques to come up with new ways to approach classic questions in the field. 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):

• Matrix Scaling and Balancing via Box Constrained Newton’s Method and Interior Point Methods, with Michael B. Cohen, Dimitris Tsipras, Adrian Vladu.
  Manuscript.
• Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in O(m^10/7 log W) Time, with Michael B. Cohen, Piotr Sankowski, Adrian Vladu.
  SODA 2017.
• Computing Maximum Flow with Augmenting Electrical Flows,
  FOCS 2016. Invited to the special issue.
On the Resiliency of Randomized Routing Against Multiple Edge Failures, with Marco Chiesa, Andrei Gurtov, Slobodan Mitrović, Ilya Nikolaevskiy, Michael Schapira, Scott Shenker,
ICALP 2016.
The Quest for Resilient (Static) Forwarding Tables, with Marco Chiesa, Ilya Nikolaevskiy, Slobodan Mitrović, Aurojit Panda, Andrei Gurtov, Michael Schapira, and Scott Shenker,
INFOCOM 2016.
Fast Generation of Random Spanning Trees and the Effective Resistance Metric, with Damian Straszak, and Jakub Tarnawski,
SODA 2015.
On the Configuration LP for Maximum Budgeted Allocation, with Christos Kalaitzis, Alantha Newman, Lukáš Poláček, and Ola Svensson,
IPCO 2014. Mathematical Programming, Volume 154 Issue 1, 2015.
• Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back,
  FOCS 2013. Best Paper Award. Invited to the Journal of the ACM.
Runtime Guarantees for Regression Problems, with Hui Han Chin, Gary L. Miller, and Richard Peng,
ITCS 2013.
The Semi-stochastic Ski-rental Problem, with Debmalya Panigrahi,
FSTTCS 2011.
• A Polylogarithmic-Competitive Algorithm for the k-Server Problem, with Nikhil Bansal, Niv Buchbinder, and Seffi Naor,
  FOCS 2011. Best Paper Award. Journal of the ACM, Volume 62 Issue 5, 2015 (invited paper).
• From Graphs to Matrices, and Back: New Techniques for Graph Algorithms
  My Ph.D. thesis, MIT, EECS Department, 2011. ACM Doctoral Dissertation Award Honorable Mention. George M. Sprowls Award (for best MIT doctoral theses in CS).
• Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs , with Paul Christiano, Jonathan Kelner, Daniel Spielman, and Shang-Hua Teng,
  STOC 2011. Best Paper Award. Invited to the Journal of the ACM.
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs,
FOCS 2010.
Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms,
STOC 2010.
• An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem, with Arash Asadpour, Michel Goemans, Shayan Oveis Gharan, and Amin Saberi,
  SODA 2010. Best Paper Award.
Faster Generation of Random Spanning Trees, with Jonathan Kelner,
FOCS 2009.
Maximum Bipartite Flow in Networks with Adaptive Channel Width, with Yossi Azar, Thomas Moscibroda, Debmalya Panigrahi and Aravind Srinivasan,
ICALP 2009. Theoretical Computer Science, vol. 412(24), 2011. Special Issue.
Susceptible Two-Party Quantum Computations, with Andreas Jacoby and Maciej Liśkiewicz,
ICITS 2008.
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers, with Marcin Bienkowski,
LATIN 2008.
Data Exchange: On the Complexity of Answering Queries with Inequalities
Information Processing Letters, Vol. 94, Issue 6 (June 2005), p. 253 - 257.

     Teaching:

• 6.046: Design and Analysis of Algorithms, Spring 2017.
• 6.854: Advanced Algorithms, Fall 2016.
• 6.006: Introduction to Algorithms, Spring 2016.
• 6.S978: Graphs, Linear Algebra, and Optimization, Fall 2015.
• Theoretical Computer Science, Fall 2014.
• Theory of Computation, Spring 2014.
• Theoretical Computer Science, Fall 2013.
• Advanced Theoretical Computer Science, Spring 2013.
• Theory Gems, Fall 2012.

     Other:

• I was/am/will be on the PC of: SODA 2013, STOC 2013, SWAT 2014, ESA 2014, FOCS 2014, RANDOM 2015, STOC 2017, SPAA 2017.
• I co-founded the Interest Group on Algorithmic Foundations of Information Technology (IGAFIT) and the Highlights of Algorithms conference.
• I am co-chairing the Fall 2017 semester program on Bridging Continuous and Discrete Optimization at the Simons Institute for the Theory of Computing.
• I co-organize the Theory of Computation Colloquium and the Harvard/MIT/MSR Theory Reading Group.
• I co-organized the 1st European Meeting on Algorithmic Challenges of Big Data (ACBD 2014), as well as the Algorithmic Meeting and Algorithmic Frontiers workshops.
  (Videos of the talks from the Algorithmic Frontiers workshop are available here.)
• In the past, I have been organizing the MIT Algorithms and Complexity Seminar.