researcher

A. Ma̧dry

65 papers hereh-index 5434.3k citations107 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author4
first author3
middle author13
last author45

Across the 65 of 65 papers where every author was matched, so the position is known.

fields

cs.LG26
cs.DS15
stat.ML10
cs.CV8
cs.CY2
cs.CR1

identity via Semantic Scholar / OpenAlex

activity

20062025

most citedTowards Deep Learning Models Resistant to Adversarial Attacks

1.5k citations · 5.7k across the 60 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.DS2016

Computing Maximum Flow with Augmenting Electrical Flows

Aleksander Madry

We present an $O ~ (m^{\frac{10}{7}} U^{\frac{1}{7}})$ -time algorithm for the maximum $s$ - $t$ flow problem and the minimum $s$ - $t$ cut problem in directed graphs wit…

cs.DS2016

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in $O ~ (m^{10/7} lo g W)$ Time

Michael B. Cohen, Aleksander Madry, Piotr Sankowski +1

In this paper, we study a set of combinatorial optimization problems on weighted graphs: the shortest path problem with negative weights, the weighted perfect bipartite matching pr…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Computing Maximum Flow with Augmenting Electrical Flows

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in O~(m10/7logW) Time

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in $O ~ (m^{10/7} lo g W)$ Time