| * | 2009 |
|---|
| 10 | EE | Katarzyna Paluch,
Marcin Mucha,
Aleksander Madry:
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
APPROX-RANDOM 2009: 298-311 |
| 9 | EE | 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 | EE | Jonathan A. Kelner,
Aleksander Madry:
Faster generation of random spanning trees
CoRR abs/0908.1448: (2009) |
| 2008 |
|---|
| 7 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Susceptible Two-Party Quantum Computations.
ICITS 2008: 121-136 |
| 6 | EE | Marcin Bienkowski,
Aleksander Madry:
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers.
LATIN 2008: 252-263 |
| 5 | EE | Katarzyna Paluch,
Marcin Mucha,
Aleksander Madry:
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
CoRR abs/0812.5101: (2008) |
| 2006 |
|---|
| 4 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
Complexity of Boolean Functions 2006 |
| 3 | EE | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using quantum oblivious transfer to cheat sensitive quantum bit commitment
CoRR abs/quant-ph/0605150: (2006) |
| 2 | EE | 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 | EE | Aleksander Madry:
Data exchange: On the complexity of answering queries with inequalities.
Inf. Process. Lett. 94(6): 253-257 (2005) |
