Aleksander Mądry Email: madry(at)mit.edu I am a Postdoctoral Researcher at Microsoft Research New England. In 2011, I obtained a Ph.D. from MIT. I was advised by Michel Goemans and Jonathan Kelner. Before coming to MIT, I received M.Sc. and B.Sc. in Computer Science and B.Sc. in Physics from University of Wrocław. 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 involving dealing with uncertainty. In my research, I like employing tools and concepts of linear algebra - particularly, of spectral graph theory - to purely combinatorial problems. In the past, I worked a bit on some questions in computational complexity and quantum cryptography. My Curriculum Vitae

     News:

• I am on the PC of SODA 2013.
• Algorithmic Frontiers workshop will happen on June 11-14, 2012 at EPFL. Hope to see you there!
• Starting Fall 2012, I will be a faculty member at EPFL. I am looking for motivated students and postdocs interested in doing cutting-edge research in theoretical computer science.

     Papers:

• From Graphs to Matrices, and Back: New Techniques for Graph Algorithms
  My Ph.D. thesis, MIT, EECS Department, 2011. George M. Sprowls Award (for best MIT doctoral theses in CS). ACM Doctoral Dissertation Award Honorable Mention.
• A Polylogarithmic-Competitive Algorithm for the k-Server Problem, with Nikhil Bansal, Niv Buchbinder, and Seffi Naor,
  FOCS 2011. Best Paper Award.
• 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. Invited to the special issue of Theoretical Computer Science.
• 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.

     Other:

• I am co-organizing MSR/MIT Theory Reading Group.
• During my time at MIT, I was organizing MIT Algorithms and Complexity Seminar.