ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.07800
  4. Cited By
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel
  Computation Model
v1v2 (latest)

Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020
18 February 2020
Krzysztof Nowicki
Krzysztof Onak
ArXiv (abs)PDFHTML

Papers citing "Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model"

3 / 3 papers shown
Dynamic Maximal Matching in Clique Networks
Dynamic Maximal Matching in Clique NetworksInformation Technology Convergence and Services (ITCS), 2024
Minming Li
Peter Robinson
Xianbin Zhu
120
1
0
28 Jan 2024
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
CPMA: An Efficient Batch-Parallel Compressed Set Without PointersACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), 2023
Brian Wheatman
Randal C. Burns
A. Buluç
Helen Xu
246
6
0
08 May 2023
Input-Dynamic Distributed Algorithms for Communication Networks
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster
Janne H. Korhonen
A. Paz
Joel Rybicki
Stefan Schmid
278
3
0
15 May 2020
1
Page 1 of 1