activity
19982013
most citedImproved lower bound on the size of Kakeya sets over finite fields

13 citations · 24 across the 7 of their papers we have counts for

collaborators
Showing math.PRShow all

1 paper · 1 filter

math.PR2013

Limits of local algorithms over sparse random graphs

David Gamarnik, Madhu Sudan

Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local inform…