Image de couverture de livre

It's Hard to HAC with Average Linkage!

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bateni, MohammadHossein, Dhulipala, Laxman, Gowda, Kishen N, Hershkowitz, D Ellis, Jayaram, Rajesh, Łącki, Jakub
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Complexity Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parallel Hierarchical Agglomerative Clustering in Low Dimensions
par: Bateni, MohammadHossein, et autres
Publié: (2025)

Chamfer-Linkage for Hierarchical Agglomerative Clustering
par: Gowda, Kishen N, et autres
Publié: (2026)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
par: De Man, Quinten, et autres
Publié: (2025)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
par: Dhulipala, Laxman, et autres
Publié: (2024)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
par: Dhulipala, Laxman, et autres
Publié: (2023)

Efficient Centroid-Linkage Clustering
par: Bateni, MohammadHossein, et autres
Publié: (2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
par: Dhulipala, Laxman, et autres
Publié: (2024)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
par: Blelloch, Guy, et autres
Publié: (2026)

Towards Scalable and Practical Batch-Dynamic Connectivity
par: De Man, Quinten, et autres
Publié: (2024)

Parallel Algorithms for Hierarchical Nucleus Decomposition
par: Shi, Jessica, et autres
Publié: (2023)

Distributed Triangle Detection is Hard in Few Rounds
par: Assadi, Sepehr, et autres
Publié: (2025)

Parallel Integer Sort: Theory and Practice
par: Dong, Xiaojun, et autres
Publié: (2024)

Parallel Batch-Dynamic Maximal Independent Set
par: Blelloch, Guy, et autres
Publié: (2026)

Segmented Operations using Matrix Multiplications
par: Sobczyk, Aleksandros, et autres
Publié: (2025)

Testing Spreading Behavior in Networks with Arbitrary Topologies
par: Modanese, Augusto, et autres
Publié: (2023)

Work-Efficient Parallel Counting via Sampling
par: Liu, Hongyang, et autres
Publié: (2024)

Finding a Fair Scoring Function for Top-$k$ Selection: From Hardness to Practice
par: Cai, Guangya
Publié: (2025)

PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing
par: Rubel, Tobias, et autres
Publié: (2026)

To Store or Not to Store: a graph theoretical approach for Dataset Versioning
par: Guo, Anxin, et autres
Publié: (2024)

$O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN
par: Gan, Junhao, et autres
Publié: (2025)

Model-Agnostic Approximation of Constrained Forest Problems
par: Coupette, Corinna, et autres
Publié: (2024)

Selective Population Protocols
par: Gańczorz, Adam, et autres
Publié: (2023)

A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition
par: Lettich, Richard
Publié: (2024)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
par: Dindoost, Mohammad, et autres
Publié: (2025)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
par: Lechowicz, Adam, et autres
Publié: (2023)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
par: Jakob, Manuel, et autres
Publié: (2025)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
par: Feist, Dankrad, et autres
Publié: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
par: Li, Fuhuan, et autres
Publié: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
par: Gil, Yuval, et autres
Publié: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
par: Chang, Yi-Jun, et autres
Publié: (2022)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
par: McCoy, Hunter, et autres
Publié: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
par: Bui, Hong Duc, et autres
Publié: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
par: Carmel, Amir, et autres
Publié: (2026)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
par: Dang'ana, Michael
Publié: (2026)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

On Distributed Computation of the Minimum Triangle Edge Transversal
par: Censor-Hillel, Keren, et autres
Publié: (2024)