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 Õ (m10/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
https://portal.mardi4nfdi.de/entity/Q54176322014-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