4 citations · 5 across the 4 of their papers we have counts for
1 paper · 1 filter
Ruben Becker, Yuval Emek, Christoph Lenzen
In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomp…