Showing cs.DCShow all
2 papers · 1 filter
cs.DC2024
Local problems in trees across a wide range of distributed models
Anubhav Dhar, Eli Kujawa, Henrik Lievonen +4
The randomized online-LOCAL model captures a number of models of computing; it is at least as strong as all of these models: - the classical LOCAL model of distributed graph algori…
cs.DC2024
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
Chetan Gupta, Janne H. Korhonen, Jan Studený +2
In prior work, Gupta et al. (SPAA 2022) presented a distributed algorithm for multiplying sparse matrices, using computers. They assumed that the input matrices ar…