Image de couverture de livre

Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Haeupler, Bernhard, Kaufmann, Marc, Ravi, Raghu Raman, Schaller, Ulysse
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improving the Bit Complexity of Communication for Distributed Convex Optimization
par: Ghadiri, Mehrdad, et autres
Publié: (2024)

A Cut-Matching Game for Constant-Hop Expanders
par: Haeupler, Bernhard, et autres
Publié: (2022)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
par: Ashvinkumar, Vikrant, et autres
Publié: (2023)

A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
par: Valdeira, Pedro, et autres
Publié: (2023)

Communication-efficient Vertical Federated Learning via Compressed Error Feedback
par: Valdeira, Pedro, et autres
Publié: (2024)

Vertical Federated Learning with Missing Features During Training and Inference
par: Valdeira, Pedro, et autres
Publié: (2024)

A Primal-Dual Framework for Symmetric Cone Programming
par: Zheng, Jiaqi, et autres
Publié: (2024)

Massively Parallel Algorithms for Approximate Shortest Paths
par: Dory, Michal, et autres
Publié: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
par: Cambus, Mélanie, et autres
Publié: (2022)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
par: Bonamy, Marthe, et autres
Publié: (2025)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
par: Assadi, Sepehr
Publié: (2023)

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

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Local Density and its Distributed Approximation
par: Christiansen, Aleksander Bjørn, et autres
Publié: (2024)

Improved Byzantine Agreement under an Adaptive Adversary
par: Dufoulon, Fabien, et autres
Publié: (2025)

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

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
par: Manoharan, Vignesh, et autres
Publié: (2023)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

DAG-Inducing Problems and Algorithms
par: Gupta, Arya Tanmay, et autres
Publié: (2023)

Eventually Lattice-Linear Algorithms
par: Gupta, Arya Tanmay, et autres
Publié: (2023)

Distributed Graph Algorithms with Predictions
par: Boyar, Joan, et autres
Publié: (2025)

Online Load and Graph Balancing for Random Order Inputs
par: Im, Sungjin, et autres
Publié: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
par: Gil, Yuval
Publié: (2024)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
par: Boneh, Itai, et autres
Publié: (2025)

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
par: Fischer, Orr, et autres
Publié: (2025)

Techniques for Authenticating Quantile Digests
par: Scala, Alessandro
Publié: (2024)

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

Encoding Schemes for Parallel In-Place Algorithms
par: Hutton, Chase, et autres
Publié: (2025)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
par: Elkin, Michael, et autres
Publié: (2025)

PASGAL: Parallel And Scalable Graph Algorithm Library
par: Dong, Xiaojun, et autres
Publié: (2024)

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

Two Efficient Message-passing Exclusive Scan Algorithms
par: Träff, Jesper Larsson
Publié: (2026)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
par: Bai, Sirui, et autres
Publié: (2024)

Parallel Algorithms for the One Sided Crossing Minimization Problem
par: Popa, Bogdan-Ioan, et autres
Publié: (2025)

Fully Scalable MPC Algorithms for Euclidean k-Center
par: Czumaj, Artur, et autres
Publié: (2025)

Fully Scalable MPC Algorithms for Clustering in High Dimension
par: Czumaj, Artur, et autres
Publié: (2023)

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

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
par: Wang, Letong, et autres
Publié: (2023)

Computing in a Faulty Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

A Parallel Scan Algorithm in the Tensor Core Unit Model
par: Zouzias, Anastasios, et autres
Publié: (2024)