10 citations · 15 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DC2019
Smaller Cuts, Higher Lower Bounds
Amir Abboud, Keren Censor-Hillel, Seri Khoury +1
This paper proves strong lower bounds for distributed computing in the CONGEST model, by presenting the bit-gadget: a new technique for constructing graphs with small cuts. The con…
cs.DS2019★ 1 cited
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
We investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with nodes and edges, compute for all pairs of nodes the maximum-flow value between them…