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. 1412.3445
  4. Cited By
Approximation of Distances and Shortest Paths in the Broadcast Congest
  Clique
v1v2 (latest)

Approximation of Distances and Shortest Paths in the Broadcast Congest Clique

10 December 2014
S. Holzer
N. Pinsker
ArXiv (abs)PDFHTML

Papers citing "Approximation of Distances and Shortest Paths in the Broadcast Congest Clique"

18 / 18 papers shown
Title
Computing Power of Hybrid Models in Synchronous Networks
Computing Power of Hybrid Models in Synchronous Networks
Pierre Fraigniaud
Pedro Montealegre
Pablo Paredes
I. Rapaport
Martín Ríos-Wilson
Ioan Todinca
50
2
0
04 Aug 2022
Distributed Distance Approximation
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
69
13
0
10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model
Computing Shortest Paths and Diameter in the Hybrid Network Model
Fabian Kuhn
P. Schneider
85
30
0
15 Jun 2020
Exponentially Faster Shortest Paths in the Congested Clique
Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory
M. Parter
131
23
0
06 Mar 2020
Improving the Projection of Global Structures in Data through Spanning
  Trees
Improving the Projection of Global Structures in Data through Spanning Trees
Daniel Alcaide
J. Aerts
26
0
0
12 Jul 2019
Hardness of Distributed Optimization
Hardness of Distributed Optimization
Nir Bachrach
K. Censor-Hillel
Michal Dory
Yuval Efron
Dean Leitersdorf
A. Paz
48
41
0
24 May 2019
Connectivity Lower Bounds in Broadcast Congested Clique
Connectivity Lower Bounds in Broadcast Congested Clique
Shreyas Pai
Sriram V. Pemmaraju
20
11
0
22 May 2019
Fast Approximate Shortest Paths in the Congested Clique
Fast Approximate Shortest Paths in the Congested Clique
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
53
54
0
14 Mar 2019
Smaller Cuts, Higher Lower Bounds
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
46
29
0
07 Jan 2019
Large-Scale Distributed Algorithms for Facility Location with Outliers
Large-Scale Distributed Algorithms for Facility Location with Outliers
Tanmay Inamdar
Shreyas Pai
Sriram V. Pemmaraju
19
7
0
15 Nov 2018
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
70
55
0
16 May 2017
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
K. Censor-Hillel
M. Parter
Gregory Schwartzman
82
75
0
04 Aug 2016
Distributed Construction of Purely Additive Spanners
Distributed Construction of Purely Additive Spanners
K. Censor-Hillel
T. Kavitha
A. Paz
Amir Yehudayoff
38
27
0
19 Jul 2016
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
43
75
0
17 May 2016
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
93
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
54
159
0
17 Mar 2015
Fast Partial Distance Estimation and Applications
Fast Partial Distance Estimation and Applications
Christoph Lenzen
B. Patt-Shamir
55
62
0
26 Dec 2014
Lessons from the Congested Clique Applied to MapReduce
Lessons from the Congested Clique Applied to MapReduce
James Hegeman
Sriram V. Pemmaraju
81
86
0
17 May 2014
1