ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1608.01689
  4. Cited By
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions

Derandomizing Local Distributed Algorithms under Bandwidth Restrictions

4 August 2016
K. Censor-Hillel
M. Parter
Gregory Schwartzman
ArXiv (abs)PDFHTML

Papers citing "Derandomizing Local Distributed Algorithms under Bandwidth Restrictions"

16 / 16 papers shown
Title
Further Algebraic Algorithms in the Congested Clique Model and
  Applications to Graph-Theoretic Problems
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
F. Gall
31
48
0
09 Aug 2016
An Exponential Separation Between Randomized and Deterministic
  Complexity in the LOCAL Model
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
Yi-Jun Chang
T. Kopelowitz
Seth Pettie
94
166
0
26 Feb 2016
A Lower Bound for the Distributed Lovász Local Lemma
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
52
133
0
03 Nov 2015
A Fast Network-Decomposition Algorithm and its Applications to
  Constant-Time Distributed Computation
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation
Leonid Barenboim
Michael Elkin
C. Gavoille
38
9
0
21 May 2015
A Deterministic Almost-Tight Distributed Algorithm for Approximating
  Single-Source Shortest Paths
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
75
112
0
27 Apr 2015
Algebraic Methods in the Congested Clique
Algebraic Methods in the Congested Clique
K. Censor-Hillel
P. Kaski
Janne H. Korhonen
Christoph Lenzen
A. Paz
Jukka Suomela
35
159
0
17 Mar 2015
Approximation of Distances and Shortest Paths in the Broadcast Congest
  Clique
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
S. Holzer
N. Pinsker
58
57
0
10 Dec 2014
Near-Constant-Time Distributed Algorithms on a Congested Clique
Near-Constant-Time Distributed Algorithms on a Congested Clique
James Hegeman
Sriram V. Pemmaraju
Vivek Sardeshmukh
69
58
0
09 Aug 2014
Lessons from the Congested Clique Applied to MapReduce
Lessons from the Congested Clique Applied to MapReduce
James Hegeman
Sriram V. Pemmaraju
70
86
0
17 May 2014
Optimal Deterministic Routing and Sorting on the Congested Clique
Optimal Deterministic Routing and Sorting on the Congested Clique
Christoph Lenzen
67
169
0
08 Jul 2012
The Locality of Distributed Symmetry Breaking
The Locality of Distributed Symmetry Breaking
Leonid Barenboim
Michael Elkin
Seth Pettie
Johannes Schneider
85
298
0
09 Feb 2012
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed
  Setting
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting
Danny Dolev
Christoph Lenzen
Shir Peled
66
111
0
31 Jan 2012
Tight Bounds for Parallel Randomized Load Balancing
Tight Bounds for Parallel Randomized Load Balancing
Christoph Lenzen
Roger Wattenhofer
95
65
0
26 Feb 2011
Local Computation: Lower and Upper Bounds
Local Computation: Lower and Upper Bounds
Fabian Kuhn
Thomas Moscibroda
Roger Wattenhofer
83
100
0
24 Nov 2010
Distributed Verification and Hardness of Distributed Approximation
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma
S. Holzer
Liah Kor
Amos Korman
Danupon Nanongkai
Gopal Pandurangan
David Peleg
Roger Wattenhofer
85
346
0
12 Nov 2010
Distributed (Delta + 1)-coloring in linear (in Delta) time
Distributed (Delta + 1)-coloring in linear (in Delta) time
Leonid Barenboim
Michael Elkin
83
95
0
07 Dec 2008
1