Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Aleksander Madry
2010 – today
- 2013
[c13]Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng: Runtime guarantees for regression problems. ITCS 2013: 269-282- 2011
- [j2]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)
- [c12]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor: A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276
- [c11]
- [c10]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
- [i9]Aleksander Madry, Gary L. Miller, Richard Peng: Electrical Flow Algorithms for Total Variation Minimization. CoRR abs/1110.1358 (2011)
- [i8]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor: A Polylogarithmic-Competitive Algorithm for the k-Server Problem. CoRR abs/1110.1580 (2011)
- 2010
- [c9]Aleksander Madry: Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs. FOCS 2010: 245-254
- [c8]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
- [c7]Aleksander Madry: Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. STOC 2010: 121-130
- [i7]Aleksander Madry: Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms. CoRR abs/1003.5907 (2010)
- [i6]Aleksander Madry: Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs. CoRR abs/1008.1975 (2010)
- [i5]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)
2000 – 2009
- 2009
- [c6]Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry: A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. APPROX-RANDOM 2009: 298-311
- [c5]
- [c4]Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan: Maximum Bipartite Flow in Networks with Adaptive Channel Width. ICALP (2) 2009: 351-362
- [i4]Jonathan A. Kelner, Aleksander Madry: Faster generation of random spanning trees. CoRR abs/0908.1448 (2009)
- 2008
- [c3]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry: Susceptible Two-Party Quantum Computations. ICITS 2008: 121-136
- [c2]Marcin Bienkowski, Aleksander Madry: Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers. LATIN 2008: 252-263
- [i3]Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry: A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. CoRR abs/0812.5101 (2008)
- 2006
- [c1]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry: Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Complexity of Boolean Functions 2006
- [i2]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry: Using quantum oblivious transfer to cheat sensitive quantum bit commitment. CoRR abs/quant-ph/0605150 (2006)
- [i1]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
- [j1]Aleksander Madry: Data exchange: On the complexity of answering queries with inequalities. Inf. Process. Lett. 94(6): 253-257 (2005)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-19 01:01 CET by the dblp team