A tight lower bound for semi-synchronous collaborative grid exploration Sebastian BrandtJara UittoRoger Wattenhofer OriginalPaper Open access 03 February 2020 Pages: 471 - 484
The RedBlue family of universal constructions Panagiota FatourouNikolaos D. Kallimanis OriginalPaper 22 February 2020 Pages: 485 - 513
Communication complexity of approximate maximum matching in the message-passing model Zengfeng HuangBozidar RadunovicQin Zhang OriginalPaper 20 February 2020 Pages: 515 - 531
Detecting cliques in CONGEST networks Artur CzumajChristian Konrad OriginalPaper Open access 21 December 2019 Pages: 533 - 543
Fooling views: a new lower bound technique for distributed computations under congestion Amir AbboudKeren Censor-HillelChristoph Lenzen OriginalPaper 09 April 2020 Pages: 545 - 559
Fault-tolerant simulation of population protocols Giuseppe A. Di LunaPaola FlocchiniGiovanni Viglietta OriginalPaper 25 April 2020 Pages: 561 - 578