|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 6 keywords
|
|
|
|
|
Results
Found 23 publication records. Showing 23 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan |
Maximum bipartite flow in networks with adaptive channel width.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander Madry, Gary L. Miller, Richard Peng |
Electrical Flow Algorithms for Total Variation Minimization |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor |
A Polylogarithmic-Competitive Algorithm for the k-Server Problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor |
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander Madry, Debmalya Panigrahi |
The Semi-stochastic Ski-rental Problem. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander Madry |
Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Aleksander Madry |
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Aleksander Madry |
Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander Madry |
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
dynamic graph algorithms, multicommodity flow problems |
| 1 | Jonathan A. Kelner, Aleksander Madry |
Faster generation of random spanning trees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan |
Maximum Bipartite Flow in Networks with Adaptive Channel Width. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry |
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Aleksander Madry |
Faster Generation of Random Spanning Trees. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
random walks on graphs, electrical flows, spanning trees |
| 1 | Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry |
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marcin Bienkowski, Aleksander Madry |
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
online algorithms, network problems, packet buffering |
| 1 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry |
Susceptible Two-Party Quantum Computations. |
ICITS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry |
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry |
Using quantum oblivious transfer to cheat sensitive quantum bit commitment |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry |
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Aleksander Madry |
Data exchange: On the complexity of answering queries with inequalities. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")