Saved in:
| Main Author: | Lettich, Richard |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.01739 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
by: Raulet, Gabriel, et al.
Published: (2025)
by: Raulet, Gabriel, et al.
Published: (2025)
Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)
by: Chang, Yi-Jun, et al.
Published: (2026)
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)
by: De Man, Quinten, et al.
Published: (2025)
Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
by: Li, Mingzhe, et al.
Published: (2025)
by: Li, Mingzhe, et al.
Published: (2025)
On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)
by: Bonamy, Marthe, et al.
Published: (2025)
A Simple and Robust Protocol for Distributed Counting
by: Cohen, Edith, et al.
Published: (2025)
by: Cohen, Edith, et al.
Published: (2025)
A Simple Distributed Deterministic Planar Separator
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)
Lagrangian Simulation Volume-Based Contour Tree Simplification
by: Dilys, Domantas, et al.
Published: (2025)
by: Dilys, Domantas, et al.
Published: (2025)
Composable Coresets for Constrained Determinant Maximization and Beyond
by: Mahabadi, Sepideh, et al.
Published: (2022)
by: Mahabadi, Sepideh, et al.
Published: (2022)
Fast Spanning Tree Sampling in Broadcast Congested Clique
by: Anari, Nima, et al.
Published: (2026)
by: Anari, Nima, et al.
Published: (2026)
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)
by: Li, Qian, et al.
Published: (2024)
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)
by: Chang, Yi-Jun
Published: (2023)
It's Hard to HAC with Average Linkage!
by: Bateni, MohammadHossein, et al.
Published: (2024)
by: Bateni, MohammadHossein, et al.
Published: (2024)
Fully Scalable MPC Algorithms for Euclidean k-Center
by: Czumaj, Artur, et al.
Published: (2025)
by: Czumaj, Artur, et al.
Published: (2025)
Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)
by: Sahu, Abhijeet, et al.
Published: (2026)
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2023)
by: Manoharan, Vignesh, et al.
Published: (2023)
Restructuring expression dags for efficient parallelization
by: Wilhelm, Martin
Published: (2018)
by: Wilhelm, Martin
Published: (2018)
A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)
by: Mordacchini, Matteo, et al.
Published: (2025)
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)
by: Ashvinkumar, Vikrant, et al.
Published: (2023)
Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)
by: Shi, Jessica, et al.
Published: (2023)
Parallel $k$-Core Decomposition: Theory and Practice
by: Liu, Youzhe, et al.
Published: (2025)
by: Liu, Youzhe, et al.
Published: (2025)
$O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN
by: Gan, Junhao, et al.
Published: (2025)
by: Gan, Junhao, et al.
Published: (2025)
Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)
by: Baumecker, Malte, et al.
Published: (2025)
Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
by: Liu, Quanquan C., et al.
Published: (2024)
by: Liu, Quanquan C., et al.
Published: (2024)
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)
by: Ghaffari, Mohsen, et al.
Published: (2024)
A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
by: Assadi, Sepehr
Published: (2023)
by: Assadi, Sepehr
Published: (2023)
Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
by: Elkin, Michael, et al.
Published: (2025)
by: Elkin, Michael, et al.
Published: (2025)
A Primal-Dual Framework for Symmetric Cone Programming
by: Zheng, Jiaqi, et al.
Published: (2024)
by: Zheng, Jiaqi, et al.
Published: (2024)
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)
by: Chang, Yi-Jun, et al.
Published: (2022)
GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
by: Kreis, Lara, et al.
Published: (2026)
by: Kreis, Lara, et al.
Published: (2026)
Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
by: Karmegam, Arivarasan, et al.
Published: (2026)
by: Karmegam, Arivarasan, et al.
Published: (2026)
Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Harmonic Decomposition in Data Sketches
by: Wang, Dingyu
Published: (2024)
by: Wang, Dingyu
Published: (2024)
Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)
by: Censor-Hillel, Keren, et al.
Published: (2026)
Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)
by: Chang, Yi-Jun, et al.
Published: (2025)
Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)
by: Basat, Ran Ben, et al.
Published: (2025)
Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025)
by: Boyar, Joan, et al.
Published: (2025)
Similar Items
-
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024) -
Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
by: Raulet, Gabriel, et al.
Published: (2025) -
Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026) -
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025) -
Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
by: Li, Mingzhe, et al.
Published: (2025)