No. Title Author Year
1 Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees Brandt, Sebastian et al. 2021
2 Efficient CONGEST Algorithms for the Lovász Local Lemma Maus, Yannic et al. 2021
3 Massively Parallel Correlation Clustering in Bounded Arboricity Graphs Cambus, Mélanie et al. 2021
4 Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping Brandt, Sebastian et al. 2020
5 Tight Bounds for Deterministic High-Dimensional Grid Exploration Brandt, Sebastian et al. 2020
6 A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration Brandt, Sebastian et al. 2018
7 Distributed Recoloring Bonamy, Marthe et al. 2018
8 Fine-grained Lower Bounds on Cops and Robbers Brandt, Sebastian et al. 2018
9 A Tight Lower Bound for the Capture Time of the Cops and Robbers Game Brandt, Sebastian et al. 2017
10 Improved Distributed Degree Splitting and Edge Coloring Ghaffari, Mohsen et al. 2017
11 Overcoming Obstacles with Ants Langner, Tobias et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI