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. 2204.06077
  4. Cited By
PaC-trees: Supporting Parallel and Compressed Purely-Functional
  Collections

PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections

12 April 2022
Laxman Dhulipala
G. Blelloch
Yan Gu
Yihan Sun
ArXiv (abs)PDFHTML

Papers citing "PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections"

6 / 6 papers shown
Title
Parallel $k$-Core Decomposition with Batched Updates and Asynchronous
  Reads
Parallel kkk-Core Decomposition with Batched Updates and Asynchronous Reads
Quanquan C. Liu
Julian Shun
Igor Zablotchi
26
4
0
15 Jan 2024
Fast and Space-Efficient Parallel Algorithms for Influence Maximization
Fast and Space-Efficient Parallel Algorithms for Influence Maximization
Letong Wang
Xiangyun Ding
Yan Gu
Yihan Sun
62
3
0
13 Nov 2023
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
Laxman Dhulipala
Jason D. Lee
Jakub Lkacki
Vahab Mirrokni
46
10
0
07 Aug 2023
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
35
4
0
08 May 2023
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth
Laxman Dhulipala
David Eisenstat
Jakub Lacki
Vahab Mirronki
Jessica Shi
64
17
0
23 Jun 2022
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly)
  Work-efficient
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
Zheqi Shen
Zijin Wan
Yan Gu
Yihan Sun
62
12
0
25 May 2022
1