Smaller Cuts, Higher Lower Bounds

14 Jan 2019 Abboud Amir Censor-Hillel Keren Khoury Seri Paz Ami

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 contribution of bit-gadgets is twofold... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING
  • DATA STRUCTURES AND ALGORITHMS