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. 1711.01623
  4. Cited By
Fooling Views: A New Lower Bound Technique for Distributed Computations
  under Congestion

Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion

5 November 2017
Amir Abboud
K. Censor-Hillel
Seri Khoury
Christoph Lenzen
ArXivPDFHTML

Papers citing "Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion"

17 / 17 papers shown
Title
Improved Distributed Expander Decomposition and Nearly Optimal Triangle
  Enumeration
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
Yi-Jun Chang
Thatchaphol Saranurak
28
49
0
17 Apr 2019
Distributed Triangle Detection via Expander Decomposition
Distributed Triangle Detection via Expander Decomposition
Yi-Jun Chang
Seth Pettie
Hengjie Zhang
35
46
0
17 Jul 2018
Triangle Finding and Listing in CONGEST Networks
Triangle Finding and Listing in CONGEST Networks
Taisuke Izumi
F. Gall
46
55
0
25 May 2017
Symmetry Breaking in the Congest Model: Time- and Message-Efficient
  Algorithms for Ruling Sets
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets
Shreyas Pai
Gopal Pandurangan
Sriram V. Pemmaraju
Talal Riaz
Peter Robinson
89
24
0
22 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
Distributed Construction of Purely Additive Spanners
Distributed Construction of Purely Additive Spanners
K. Censor-Hillel
T. Kavitha
A. Paz
Amir Yehudayoff
27
27
0
19 Jul 2016
Distributed Testing of Excluded Subgraphs
Distributed Testing of Excluded Subgraphs
Pierre Fraigniaud
I. Rapaport
Ville Salo
Ioan Todinca
28
37
0
12 May 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
45
128
0
03 Nov 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
33
160
0
17 Mar 2015
Construction and impromptu repair of an MST in a distributed network
  with o(m) communication
Construction and impromptu repair of an MST in a distributed network with o(m) communication
Valerie King
S. Kutten
M. Thorup
LRM
69
60
0
11 Feb 2015
Improved Distributed Steiner Forest Construction
Improved Distributed Steiner Forest Construction
Christoph Lenzen
B. Patt-Shamir
38
23
0
08 May 2014
Enumerating Subgraph Instances Using Map-Reduce
Enumerating Subgraph Instances Using Map-Reduce
F. Afrati
Dimitris Fotakis
J. Ullman
120
135
0
02 Aug 2012
Upper and Lower Bounds on the Cost of a Map-Reduce Computation
Upper and Lower Bounds on the Cost of a Map-Reduce Computation
F. Afrati
A. Sarma
S. Salihoglu
J. Ullman
47
142
0
20 Jun 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
A Tight Lower Bound on Distributed Random Walk Computation
A Tight Lower Bound on Distributed Random Walk Computation
Danupon Nanongkai
Atish Das Sarma
Gopal Pandurangan
OT
53
46
0
14 Feb 2011
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
83
346
0
12 Nov 2010
1