Copertina

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hajiaghayi, Mohammad T., Kowalski, Dariusz R., Olkowski, Jan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Distributed, Parallel, and Cluster Computing Cryptography and Security Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries
di: Kowalski, Dariusz R., et al.
Pubblicazione: (2025)

Bankrupting DoS Attackers
di: Chakraborty, Trisha, et al.
Pubblicazione: (2022)

2G2T: Constant-Size, Statistically Sound MSM Outsourcing
di: Khabbazian, Majid
Pubblicazione: (2026)

MVP-ORAM: a Wait-free Concurrent ORAM for Confidential BFT Storage
di: Vassantlal, Robin, et al.
Pubblicazione: (2025)

Scalable contribution bounding to achieve privacy
di: Cohen-Addad, Vincent, et al.
Pubblicazione: (2025)

Constant Degree Networks for Almost-Everywhere Reliable Transmission
di: Bafna, Mitali, et al.
Pubblicazione: (2024)

Constitutional Consensus for Democratic Governance
di: Keidar, Idit, et al.
Pubblicazione: (2025)

Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks
di: Zhang, Yunqi, et al.
Pubblicazione: (2024)

OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast
di: Chen, Jinyuan
Pubblicazione: (2024)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2023)

Time-Optimal and Energy-Efficient Deterministic Consensus
di: Meir, Shachar, et al.
Pubblicazione: (2025)

Near-Optimal Resilient Labeling Schemes
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2024)

GPU Acceleration of Sparse Fully Homomorphic Encrypted DNNs
di: D'Agata, Lara, et al.
Pubblicazione: (2026)

Access Control for Information-Theoretically Secure Key-Document Stores
di: Li, Yin, et al.
Pubblicazione: (2025)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
di: Boneh, Itai, et al.
Pubblicazione: (2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
di: Baumecker, Malte, et al.
Pubblicazione: (2025)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2024)

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
di: Manoharan, Vignesh, et al.
Pubblicazione: (2022)

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2024)

Undetectable Selfish Mining
di: Bahrani, Maryam, et al.
Pubblicazione: (2023)

PureLottery: Fair and Bias-Resistant Leader Election with a Novel Single-Elimination Tournament Algorithm
di: Ballweg, Jonas
Pubblicazione: (2024)

Scalable Fault-Tolerant MapReduce
di: Hespe, Demian, et al.
Pubblicazione: (2024)

Selective Population Protocols
di: Gańczorz, Adam, et al.
Pubblicazione: (2023)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
di: Fokkink, Wan, et al.
Pubblicazione: (2026)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
di: Polyanskii, Nikita, et al.
Pubblicazione: (2024)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
di: Lechowicz, Adam, et al.
Pubblicazione: (2023)

Parallel and (Nearly) Work-Efficient Dynamic Programming
di: Ding, Xiangyun, et al.
Pubblicazione: (2024)

Near-optimal population protocols on bounded-degree trees
di: Rybicki, Joel, et al.
Pubblicazione: (2026)

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
di: Filtser, Arnold, et al.
Pubblicazione: (2026)

Optimal Distributed Replacement Paths
di: Chang, Yi-Jun, et al.
Pubblicazione: (2025)

On the Randomized Locality of Matching Problems in Regular Graphs
di: Khoury, Seri, et al.
Pubblicazione: (2025)

Towards Optimal Distributed Delta Coloring
di: Jakob, Manuel, et al.
Pubblicazione: (2025)

Optimal Deterministic Rendezvous in Labeled Lines
di: Bourreau, Yann, et al.
Pubblicazione: (2025)

Online Load and Graph Balancing for Random Order Inputs
di: Im, Sungjin, et al.
Pubblicazione: (2024)

Optimal local certification on graphs of bounded pathwidth
di: Baterisna, Dan Alden, et al.
Pubblicazione: (2025)

Towards Optimal Distributed Edge Coloring with Fewer Colors
di: Jakob, Manuel, et al.
Pubblicazione: (2025)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
di: Flin, Maxime, et al.
Pubblicazione: (2026)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
di: Bai, Sirui, et al.
Pubblicazione: (2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

Improved Byzantine Agreement under an Adaptive Adversary
di: Dufoulon, Fabien, et al.
Pubblicazione: (2025)