Aleksander Mądry

From MaRDI portal
Person:541658

Available identifiers

zbMath Open madry.aleksanderWikidataQ60832614 ScholiaQ60832614MaRDI QIDQ541658

List of research outcomes





PublicationDate of PublicationType
Round compression for parallel matching algorithms2020-10-29Paper
Gradients and flows: continuous optimization approaches to the maximum flow problem2020-09-22Paper
\(k\)-server via multiscale entropic regularization2019-08-22Paper
Round compression for parallel matching algorithms2019-08-22Paper
A polylogarithmic-competitive algorithm for the \(k\)-server problem2018-08-02Paper
Negative-weight shortest paths and unit capacity minimum cost flow in \(\tilde{O}(m^{10/7}\log W)\) time (extended abstract)2018-07-16Paper
On the Resiliency of Randomized Routing Against Multiple Edge Failures2017-12-19Paper
Fast generation of random spanning trees and the effective resistance metric2017-10-05Paper
An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem2017-09-26Paper
Runtime guarantees for regression problems2017-05-16Paper
On the configuration LP for maximum budgeted allocation2015-12-09Paper
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms2014-08-13Paper
A Polylogarithmic-Competitive Algorithm for the k-Server Problem2014-07-30Paper
Faster Generation of Random Spanning Trees2014-07-25Paper
Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs2014-06-05Paper
On the configuration LP for maximum budgeted allocation2014-06-02Paper
An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem2014-05-22Paper
The semi-stochastic ski-rental problem2012-08-31Paper
Maximum bipartite flow in networks with adaptive channel width2011-06-07Paper
Data exchange: on the complexity of answering queries with inequalities2009-12-04Paper
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem2009-10-28Paper
Maximum Bipartite Flow in Networks with Adaptive Channel Width2009-07-14Paper
Susceptible Two-Party Quantum Computations2009-01-09Paper
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers2008-04-15Paper

Research outcomes over time

This page was built for person: Aleksander Mądry