Communication complexity of approximate maximum matching in the message-passing model

期刊： DISTRIBUTED COMPUTING, 2020; 33 (6)

We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. T......

What can be sampled locally?

期刊： DISTRIBUTED COMPUTING, 2020; 33 (3-4)

The local computation of Linial [FOCS'87] and Naor and Stockmeyer [STOC'93] studies whether a locally defined distributed computing problem is locally......

Leveraging multiple channels in ad hoc networks

期刊： DISTRIBUTED COMPUTING, 2019; 32 (2)

We examine the utility of multiple channels of communication in wireless networks under the SINR model of interference. The central question is whethe......

JIF：1.33