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 2013Show all

1 paper · 1 filter

cs.DS2013★ 8 cited

Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back

Aleksander Madry

We present an -time algorithm for the maximum s-t flow and the minimum s-t cut problems in directed graphs with unit capacities. This is th…