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. 1807.04900
  4. Cited By
Parameterized Distributed Algorithms

Parameterized Distributed Algorithms

13 July 2018
Ran Ben-Basat
Ken-ichi Kawarabayashi
Gregory Schwartzman
ArXivPDFHTML

Papers citing "Parameterized Distributed Algorithms"

11 / 11 papers shown
Title
Optimal Distributed Covering Algorithms
Optimal Distributed Covering Algorithms
Ran Ben-Basat
G. Even
Ken-ichi Kawarabayashi
Gregory Schwartzman
25
13
0
25 Feb 2019
A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover
  in $O(\log n\logΔ/ \log^2\logΔ)$ Rounds
A Deterministic Distributed 222-Approximation for Weighted Vertex Cover in O(log⁡nlog⁡Δ/log⁡2log⁡Δ)O(\log n\logΔ/ \log^2\logΔ)O(lognlogΔ/log2logΔ) Rounds
Ran Ben-Basat
G. Even
Ken-ichi Kawarabayashi
Gregory Schwartzman
28
4
0
04 Apr 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms
Minor Excluded Network Families Admit Fast Distributed Algorithms
Bernhard Haeupler
Jason Li
Goran Zuzic
37
32
0
18 Jan 2018
Distributed Approximation of Maximum Independent Set and Maximum
  Matching
Distributed Approximation of Maximum Independent Set and Maximum Matching
R. Bar-Yehuda
K. Censor-Hillel
M. Ghaffari
Gregory Schwartzman
33
50
0
01 Aug 2017
Deterministic subgraph detection in broadcast CONGEST
Deterministic subgraph detection in broadcast CONGEST
Janne H. Korhonen
Joel Rybicki
68
52
0
29 May 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
K. Censor-Hillel
Seri Khoury
A. Paz
60
55
0
16 May 2017
A Note on Hardness of Diameter Approximation
A Note on Hardness of Diameter Approximation
K. Bringmann
Sebastian Krinninger
31
8
0
05 May 2017
Near-Linear Lower Bounds for Distributed Distance Computations, Even in
  Sparse Networks
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
Amir Abboud
K. Censor-Hillel
Seri Khoury
37
74
0
17 May 2016
Fast Routing Table Construction Using Small Messages
Fast Routing Table Construction Using Small Messages
Christoph Lenzen
B. Patt-Shamir
73
75
0
21 Oct 2012
Local Computation: Lower and Upper Bounds
Local Computation: Lower and Upper Bounds
Fabian Kuhn
Thomas Moscibroda
Roger Wattenhofer
81
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
80
346
0
12 Nov 2010
1