:: Library Catalog

Slika omota

Spremljeno u:

Bibliografski detalji
Glavni autori:	Augustine, John, Dufoulon, Fabien, Pandurangan, Gopal
Format:	Preprint
Izdano:	2024
Teme:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Online pristup:	https://arxiv.org/abs/2410.20865
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!

Slični predmeti

Improved Byzantine Agreement under an Adaptive Adversary
od: Dufoulon, Fabien, i dr.
Izdano: (2025)

Quantum Communication Advantage for Leader Election and Agreement
od: Dufoulon, Fabien, i dr.
Izdano: (2025)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
od: Dufoulon, Fabien, i dr.
Izdano: (2025)

Energy-Efficient Maximal Independent Sets in Radio Networks
od: Banasik, Dominick, i dr.
Izdano: (2025)

Fast Gossip-based Rumor Spreading using Small Messages
od: Dufoulon, Fabien, i dr.
Izdano: (2026)

Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
od: Dufoulon, Fabien, i dr.
Izdano: (2026)

The Singular Optimality of Distributed Computation in LOCAL
od: Dufoulon, Fabien, i dr.
Izdano: (2024)

Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks
od: Gupta, Aayush, i dr.
Izdano: (2025)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
od: Almeida, Paulo Sérgio, i dr.
Izdano: (2024)

OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast
od: Chen, Jinyuan
Izdano: (2024)

Distributed Download from an External Data Source in Faulty Majority Settings
od: Augustine, John, i dr.
Izdano: (2024)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
od: Li, Qian, i dr.
Izdano: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
od: Gil, Yuval
Izdano: (2024)

Bounded Memory in Distributed Networks
od: Basat, Ran Ben, i dr.
Izdano: (2025)

Fully Scalable MPC Algorithms for Euclidean k-Center
od: Czumaj, Artur, i dr.
Izdano: (2025)

Fully Scalable MPC Algorithms for Clustering in High Dimension
od: Czumaj, Artur, i dr.
Izdano: (2023)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
od: De Man, Quinten, i dr.
Izdano: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
od: Chang, Yi-Jun, i dr.
Izdano: (2022)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
od: Feist, Dankrad, i dr.
Izdano: (2025)

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

Adaptive Massively Parallel Coloring in Sparse Graphs
od: Latypov, Rustam, i dr.
Izdano: (2024)

Distributed Stochastic Graph Algorithms
od: Censor-Hillel, Keren, i dr.
Izdano: (2026)

Optimal Distributed Replacement Paths
od: Chang, Yi-Jun, i dr.
Izdano: (2025)

Distributed Graph Algorithms with Predictions
od: Boyar, Joan, i dr.
Izdano: (2025)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
od: Bonomi, Silvia, i dr.
Izdano: (2021)

Distributed Maximum Flow in Planar Graphs
od: Abd-Elhaleem, Yaseen, i dr.
Izdano: (2024)

Local Density and its Distributed Approximation
od: Christiansen, Aleksander Bjørn, i dr.
Izdano: (2024)

$k$-Center Clustering in Distributed Models
od: Biabani, Leyla, i dr.
Izdano: (2024)

Fast Deterministic Distributed Degree Splitting
od: Maus, Yannic, i dr.
Izdano: (2026)

Meta-Theorems for Cuttable Distributed Problems
od: Bonamy, Marthe, i dr.
Izdano: (2026)

Distributed Subgraph Finding: Progress and Challenges
od: Censor-Hillel, Keren
Izdano: (2022)

Towards Optimal Distributed Delta Coloring
od: Jakob, Manuel, i dr.
Izdano: (2025)

On Distributed Computation of the Minimum Triangle Edge Transversal
od: Censor-Hillel, Keren, i dr.
Izdano: (2024)

Distributed Delta-Coloring under Bandwidth Limitations
od: Maus, Yannic, i dr.
Izdano: (2024)

Distributed Santa Claus via Global Rounding
od: de Vos, Tijn, i dr.
Izdano: (2026)

Congested Clique Counting for Local Gibbs Distributions
od: Sobel, Joshua Z.
Izdano: (2025)

The Local Information Cost of Distributed Graph Spanners
od: Robinson, Peter
Izdano: (2020)

A Simple and Robust Protocol for Distributed Counting
od: Cohen, Edith, i dr.
Izdano: (2025)

A Simple Distributed Deterministic Planar Separator
od: Abd-Elhaleem, Yaseen, i dr.
Izdano: (2026)

Distributed Lovász Local Lemma under Bandwidth Limitations
od: Halldórsson, Magnús M., i dr.
Izdano: (2024)