Fast Deterministic Algorithms for Highly-Dynamic Networks

Fast Deterministic Algorithms for Highly-Dynamic Networks

13 January 2019

K. Censor-Hillel

Gregory Schwartzman

Papers citing "Fast Deterministic Algorithms for Highly-Dynamic Networks"

12 / 12 papers shown

Title
How much does randomness help with locally checkable problems? Alkida Balliu S. Brandt Dennis Olivetti Jukka Suomela 31 29 0 18 Feb 2019
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 32 93 0 08 Jan 2019
Local Distributed Algorithms in Highly Dynamic Networks P. Bamberger Fabian Kuhn Yannic Maus 68 14 0 27 Feb 2018
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models Leonid Barenboim Michael Elkin Uri Goldenberg 47 70 0 01 Dec 2017
New Classes of Distributed Time Complexity Alkida Balliu J. Hirvonen Janne H. Korhonen Tuomo Lempiäinen Dennis Olivetti Jukka Suomela 36 53 0 06 Nov 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 40 96 0 20 Apr 2017
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model Yi-Jun Chang T. Kopelowitz Seth Pettie 89 160 0 26 Feb 2016
Local Conflict Coloring Pierre Fraigniaud Marc Heinrich A. Kosowski 36 135 0 04 Nov 2015
A Lower Bound for the Distributed Lovász Local Lemma S. Brandt Orr Fischer J. Hirvonen Barbara Keller Tuomo Lempiäinen Joel Rybicki Jukka Suomela Jara Uitto 45 128 0 03 Nov 2015
Optimal Dynamic Distributed MIS K. Censor-Hillel Elad Haramaty Zohar Karnin 40 54 0 15 Jul 2015
The Locality of Distributed Symmetry Breaking Leonid Barenboim Michael Elkin Seth Pettie Johannes Schneider 81 296 0 09 Feb 2012
Distributed (Delta + 1)-coloring in linear (in Delta) time Leonid Barenboim Michael Elkin 78 95 0 07 Dec 2008