1. A tight lower bound for semi-synchronous collaborative grid exploration

   • Sebastian Brandt
   • Jara Uitto
   • Roger Wattenhofer

   OriginalPaper Open access 03 February 2020 Pages: 471 - 484

   

2. The RedBlue family of universal constructions

   • Panagiota Fatourou
   • Nikolaos D. Kallimanis

   OriginalPaper 22 February 2020 Pages: 485 - 513

   

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

   • Zengfeng Huang
   • Bozidar Radunovic
   • Qin Zhang

   OriginalPaper 20 February 2020 Pages: 515 - 531

   

4. Detecting cliques in CONGEST networks

   • Artur Czumaj
   • Christian Konrad

   OriginalPaper Open access 21 December 2019 Pages: 533 - 543

   

5. Fooling views: a new lower bound technique for distributed computations under congestion

   • Amir Abboud
   • Keren Censor-Hillel
   • Christoph Lenzen

   OriginalPaper 09 April 2020 Pages: 545 - 559

   

6. Fault-tolerant simulation of population protocols

   • Giuseppe A. Di Luna
   • Paola Flocchini
   • Giovanni Viglietta

   OriginalPaper 25 April 2020 Pages: 561 - 578