 | 2011 |
| 23 |  | Nikhil Bansal,
Niv Buchbinder,
Aleksander Madry,
Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem.
FOCS 2011: 267-276 |
| 22 |  | Aleksander Madry,
Debmalya Panigrahi:
The Semi-stochastic Ski-rental Problem.
FSTTCS 2011: 300-311 |
| 21 |  | Paul Christiano,
Jonathan A. Kelner,
Aleksander Madry,
Daniel A. Spielman,
Shang-Hua Teng:
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs.
STOC 2011: 273-282 |
| 20 |  | Aleksander Madry,
Gary L. Miller,
Richard Peng:
Electrical Flow Algorithms for Total Variation Minimization
CoRR abs/1110.1358: (2011) |
| 19 |  | Nikhil Bansal,
Niv Buchbinder,
Aleksander Madry,
Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
CoRR abs/1110.1580: (2011) |
| 18 |  | Yossi Azar,
Aleksander Madry,
Thomas Moscibroda,
Debmalya Panigrahi,
Aravind Srinivasan:
Maximum bipartite flow in networks with adaptive channel width.
Theor. Comput. Sci. 412(24): 2577-2587 (2011) |
| 2010 |
| 17 |  | Aleksander Madry:
Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs.
FOCS 2010: 245-254 |
| 16 |  | Arash Asadpour,
Michel X. Goemans,
Aleksander Madry,
Shayan Oveis Gharan,
Amin Saberi:
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem.
SODA 2010: 379-389 |
| 15 |  | Aleksander Madry:
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms.
STOC 2010: 121-130 |
| 14 |  | Aleksander Madry:
Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms
CoRR abs/1003.5907: (2010) |
| 13 |  | Aleksander Madry:
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
CoRR abs/1008.1975: (2010) |
| 12 |  | Paul Christiano,
Jonathan A. Kelner,
Aleksander Madry,
Daniel A. Spielman,
Shang-Hua Teng:
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
CoRR abs/1010.2921: (2010) |
| 2009 |
| 11 |  | Katarzyna E. Paluch,
Marcin Mucha,
Aleksander Madry:
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
APPROX-RANDOM 2009: 298-311 |
| 10 |  | Jonathan A. Kelner,
Aleksander Madry:
Faster Generation of Random Spanning Trees.
FOCS 2009: 13-21 |
| 9 |  | Yossi Azar,
Aleksander Madry,
Thomas Moscibroda,
Debmalya Panigrahi,
Aravind Srinivasan:
Maximum Bipartite Flow in Networks with Adaptive Channel Width.
ICALP (2) 2009: 351-362 |
| 8 |  | Jonathan A. Kelner,
Aleksander Madry:
Faster generation of random spanning trees
CoRR abs/0908.1448: (2009) |
| 2008 |
| 7 |  | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Susceptible Two-Party Quantum Computations.
ICITS 2008: 121-136 |
| 6 |  | Marcin Bienkowski,
Aleksander Madry:
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers.
LATIN 2008: 252-263 |
| 5 |  | Katarzyna E. Paluch,
Marcin Mucha,
Aleksander Madry:
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
CoRR abs/0812.5101: (2008) |
| 2006 |
| 4 |  | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
Complexity of Boolean Functions 2006 |
| 3 |  | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using quantum oblivious transfer to cheat sensitive quantum bit commitment
CoRR abs/quant-ph/0605150: (2006) |
| 2 |  | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
Electronic Colloquium on Computational Complexity (ECCC) 13(085): (2006) |
| 2005 |
| 1 |  | Aleksander Madry:
Data exchange: On the complexity of answering queries with inequalities.
Inf. Process. Lett. 94(6): 253-257 (2005) |