Image de couverture de livre

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Almeida, Paulo Sérgio, Shapiro, Ehud
Format:	Preprint
Publié:	2024
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fully-Distributed Byzantine Agreement in Sparse Networks
par: Augustine, John, et autres
Publié: (2024)

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

Approaches to Conflict-free Replicated Data Types
par: Almeida, Paulo Sérgio
Publié: (2023)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

New Concurrent Order Maintenance Data Structure
par: Guo, Bin, et autres
Publié: (2022)

Efficient Distributed Data Structures for Future Many-core Architectures
par: Fatourou, Panagiota, et autres
Publié: (2024)

Distributed Download from an External Data Source in Faulty Majority Settings
par: Augustine, John, et autres
Publié: (2024)

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

A Simple and Robust Protocol for Distributed Counting
par: Cohen, Edith, et autres
Publié: (2025)

A Simple Distributed Deterministic Planar Separator
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2026)

A Hybrid Vectorized Merge Sort on ARM NEON
par: Zhou, Jincheng, et autres
Publié: (2024)

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

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

A Distributed Conductance Tester Without Global Information Collection
par: Batu, Tugkan, et autres
Publié: (2023)

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

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
par: Li, Qian, et autres
Publié: (2024)

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

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

Can Like Attract Like? A Study of Homonymous Gathering in Networks
par: Devismes, Stéphane, et autres
Publié: (2025)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
par: Hsieh, Chou-Ying, et autres
Publié: (2024)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
par: Rodriguez, Matthew, et autres
Publié: (2024)

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
par: Coluzzi, Massimo, et autres
Publié: (2024)

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

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

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
par: Sahu, Abhijeet, et autres
Publié: (2026)

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
par: Ghaffari, Mohsen, et autres
Publié: (2024)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
par: Chakraborty, Srijan, et autres
Publié: (2025)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
par: Manor, Daniel, et autres
Publié: (2025)

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

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

Constitutional Consensus for Democratic Governance
par: Keidar, Idit, et autres
Publié: (2025)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
par: Bonomi, Silvia, et autres
Publié: (2021)

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

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

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
par: Yang, Mingqi
Publié: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
par: Wang, Letong, et autres
Publié: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
par: Liu, Quanquan C., et autres
Publié: (2024)

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
par: Prokopenko, Andrey, et autres
Publié: (2024)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
par: Pourdamghani, Arash, et autres
Publié: (2024)