Aleksander Mądry I'm a Ph.D. student in the Theory of Computation Group, Computer Science and Artificial Intelligence Lab at MIT. I'm delighted to have Prof. Michel Goemans as my advisor. Before coming here I received M.Sc. in Computer Science and B.Sc. in Physics from University of Wrocław. Email: madry(at)mit.edu Research Interests: I'm mainly interested in the design and analysis of algorithms. So far, I have investigated topics in combinatorial optimization, computational complexity, online algorithms, and spectral graph theory. Aside from that, I enjoy exploring the field of quantum cryptography, especially looking for quantum realizations of fundamental cryptographic primitives. My Curriculum Vitae

     Papers:

• 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. Winner of the Best Paper Award.
• Faster generation of random spanning trees, with Jonathan Kelner
  FOCS 2009.
• A 7/9 approximation of Maximum Traveling Salesman problem, with Marcin Mucha and Katarzyna Paluch
  APPROX 2009.
• Maximum Bipartite Flow in Networks with Adaptive Channel Width, with Yossi Azar, Thomas Moscibroda, Debmalya Panigrahi and Aravind Srinivasan
  ICALP 2009. Invited to a 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.
• Linear languages recognition in deterministic polynomial time and sub-linear space,
  M.Sc. thesis.
• 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 organizing Algorithms and Complexity Seminar