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. 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

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
Title
Dynamic Maximal Matching in Clique Networks
Dynamic Maximal Matching in Clique Networks
Minming Li
Peter Robinson
Xianbin Zhu
24
1
0
28 Jan 2024
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
Brian Wheatman
Randal C. Burns
A. Buluç
Helen Xu
15
4
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
47
3
0
15 May 2020
1