Image de couverture de livre

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fischer, Orr, Parter, Merav
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms 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

Distributed Interactive Proofs for Planarity with Log-Star Communication
par: Gil, Yuval, et autres
Publié: (2025)

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

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, 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)

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
par: Filtser, Arnold, et autres
Publié: (2026)

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

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

Scalable Fault-Tolerant MapReduce
par: Hespe, Demian, et autres
Publié: (2024)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
par: Fokkink, Wan, et autres
Publié: (2026)

Deterministic Expander Routing: Faster and More Versatile
par: Chang, Yi-Jun, et autres
Publié: (2024)

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

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

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

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
par: Censor-Hillel, Keren, et autres
Publié: (2023)

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

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

Constrained Cuts, Flows, and Lattice-Linearity
par: Streit, Robert, et autres
Publié: (2025)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
par: Robinson, Peter, et autres
Publié: (2025)

Lock-Free Augmented Trees
par: Fatourou, Panagiota, et autres
Publié: (2024)

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

Round and Communication Efficient Graph Coloring
par: Chang, Yi-Jun, et autres
Publié: (2024)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
par: Chang, Yi-Jun
Publié: (2023)

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

Local Ratio based Real-time Job Offloading and Resource Allocation in Mobile Edge Computing
par: Gao, Chuanchao, et autres
Publié: (2025)

Constant Degree Networks for Almost-Everywhere Reliable Transmission
par: Bafna, Mitali, et autres
Publié: (2024)

No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
par: Motiwala, Yusuf
Publié: (2025)

Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries
par: Kowalski, Dariusz R., et autres
Publié: (2025)

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
par: Laukemann, Jan, et autres
Publié: (2024)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
par: Izumi, Taisuke, et autres
Publié: (2023)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, 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)

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

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
par: Baumecker, Malte, et autres
Publié: (2025)

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

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
par: Mordacchini, Matteo, et autres
Publié: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
par: Meir, Shachar, et autres
Publié: (2025)

BLEST: Blazingly Efficient BFS using Tensor Cores
par: Elbek, Deniz, et autres
Publié: (2025)

Weighted Matching in a Poly-Streaming Model
par: Ullah, Ahammed, et autres
Publié: (2025)