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. 1905.00850
  4. Cited By
Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity

Log Diameter Rounds Algorithms for 222-Vertex and 222-Edge Connectivity

2 May 2019
Alexandr Andoni
C. Stein
Peilin Zhong
ArXiv (abs)PDFHTML

Papers citing "Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity"

4 / 4 papers shown
Title
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Yi-Jun Chang
Danling Zheng
94
1
0
15 Apr 2023
Massively Parallel Algorithms for Distance Approximation and Spanners
Massively Parallel Algorithms for Distance Approximation and Spanners
Amartya Shankha Biswas
Michal Dory
M. Ghaffari
Slobodan Mitrović
Yasamin Nazari
97
20
0
02 Mar 2020
Equivalence Classes and Conditional Hardness in Massively Parallel
  Computations
Equivalence Classes and Conditional Hardness in Massively Parallel Computations
Danupon Nanongkai
Michele Scquizzato
63
18
0
07 Jan 2020
New lower bounds for Massively Parallel Computation from query
  complexity
New lower bounds for Massively Parallel Computation from query complexity
Moses Charikar
Weiyun Ma
Li-Yang Tan
39
1
0
05 Jan 2020
1