The following pages link to Aleksander Mądry (Q541658):
Displaying 24 items.
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Data exchange: on the complexity of answering queries with inequalities (Q1041761) (← links)
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (Q2875138) (← links)
- The Semi-stochastic Ski-rental Problem (Q2911633) (← links)
- Runtime guarantees for regression problems (Q2986877) (← links)
- A Polylogarithmic-Competitive Algorithm for the <i>k</i> -Server Problem (Q3177748) (← links)
- Maximum Bipartite Flow in Networks with Adaptive Channel Width (Q3638105) (← links)
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem (Q3638885) (← links)
- Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) (Q4575786) (← links)
- On the Resiliency of Randomized Routing Against Multiple Edge Failures (Q4598277) (← links)
- GRADIENTS AND FLOWS: CONTINUOUS OPTIMIZATION APPROACHES TO THE MAXIMUM FLOW PROBLEM (Q5122160) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Faster Generation of Random Spanning Trees (Q5171207) (← links)
- k-server via multiscale entropic regularization (Q5230272) (← links)
- Round compression for parallel matching algorithms (Q5230311) (← links)
- An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem (Q5360842) (← links)
- Fast Generation of Random Spanning Trees and the Effective Resistance Metric (Q5363075) (← links)
- (Q5417632) (← links)
- On the Configuration LP for Maximum Budgeted Allocation (Q5419007) (← links)
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (Q5419097) (← links)
- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers (Q5458533) (← links)
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem (Q5494971) (← links)
- Susceptible Two-Party Quantum Computations (Q5502797) (← links)
