Showing 1–20 of 61 results
/ Date/ Name
May 14, 2018Theoretically Efficient Parallel Graph Algorithms Can Be Fast and ScalableSep 24, 2020Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets PracticeOct 27, 2019Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMsOct 25, 2018Batch-Parallel Euler Tour TreesJun 8, 2021ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor ChainApr 12, 2022PaC-trees: Supporting Parallel and Compressed Purely-Functional CollectionsApr 17, 2019Low-Latency Graph Streaming Using Compressed Purely-Functional TreesAug 7, 2023TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge GraphsJun 23, 2022Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic DepthMar 21, 2019Parallel Batch-Dynamic Graph ConnectivityAug 10, 2020ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity AlgorithmsJun 10, 2021Hierarchical Agglomerative Graph Clustering in Nearly-Linear TimeFeb 17, 2026PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor IndexingOct 11, 2019Near-Optimal Massively Parallel Graph ConnectivityMar 30, 2020Parallel Batch-Dynamic $k$-Clique CountingJun 7, 2021Parallel Batch-Dynamic Algorithms for $k$-Core Decomposition and Related Graph ProblemsNov 22, 2021Theoretically and Practically Efficient Parallel Nucleus DecompositionMay 10, 2022Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph ClusteringNov 7, 2023Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive GraphsMay 29, 2024MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings