Copertina

Improved Bounds for Coin Flipping, Leader Election, and Random Selection

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chattopadhyay, Eshan, Gurumukhani, Mohit, Ringach, Noam, Servedio, Rocco A.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computational Complexity Cryptography and Security Distributed, Parallel, and Cluster Computing 68Q17 F.0
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Condensing and Extracting Against Online Adversaries
di: Chattopadhyay, Eshan, et al.
Pubblicazione: (2024)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
di: Böhnlein, Toni, et al.
Pubblicazione: (2024)

On the Existence of Seedless Condensers: Exploring the Terrain
di: Chattopadhyay, Eshan, et al.
Pubblicazione: (2023)

The Impact of Partial Computations on the Red-Blue Pebble Game
di: Papp, Pál András, et al.
Pubblicazione: (2025)

Stochastic well-structured transition systems
di: Aspnes, James
Pubblicazione: (2025)

Tightening I/O Lower Bounds through the Hourglass Dependency Pattern
di: Eyraud-Dubois, Lionel, et al.
Pubblicazione: (2024)

Subcubic Coin Tossing in Asynchrony without Setup
di: Mizrahi, Mose, et al.
Pubblicazione: (2026)

Two-Sided Lossless Expanders in the Unbalanced Setting
di: Chattopadhyay, Eshan, et al.
Pubblicazione: (2024)

Characterising resource management performance in Kubernetes
di: Medel, Víctor, et al.
Pubblicazione: (2024)

AEG: A Baremetal Framework for AI Acceleration via Direct Hardware Access in Heterogeneous Accelerators
di: Jiang, Hua, et al.
Pubblicazione: (2026)

Banyan: Fast Rotating Leader BFT
di: Vonlanthen, Yann, et al.
Pubblicazione: (2023)

Angelfish: Leader, DAG, or Anywhere in Between
di: Yu, Qianyu, et al.
Pubblicazione: (2025)

Deterministic Bounds in Committee Selection: Enhancing Decentralization and Scalability in Distributed Ledgers
di: Melnikov, Grigorii, et al.
Pubblicazione: (2024)

PALE: Partially Asynchronous Agile Leader Election
di: Sidik, Bronislav, et al.
Pubblicazione: (2018)

Leader Election via Unique Sink Orientation
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

Minimalist Leader Election Under Weak Communication
di: Vacus, Robin, et al.
Pubblicazione: (2025)

Leader Rotation Is Not Enough: Scrutinizing Leadership Democracy of Chained BFT Consensus
di: Tang, Yining, et al.
Pubblicazione: (2025)

Are Voters Willing to Collectively Secure Elections? Unraveling a Practical Blockchain Voting System
di: Li, Zhuolun, et al.
Pubblicazione: (2025)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
di: Balliu, Alkida, et al.
Pubblicazione: (2025)

The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
di: Balliu, Alkida, et al.
Pubblicazione: (2026)

Is a LOCAL algorithm computable?
di: Cruciani, Antonio, et al.
Pubblicazione: (2026)

Matrix Multiplication in the MPC Model
di: Joshi, Lakshya, et al.
Pubblicazione: (2025)

New Hardness Results for the LOCAL Model via a Simple Self-Reduction
di: Balliu, Alkida, et al.
Pubblicazione: (2025)

A Review on Message Complexity of the Algorithms for Clock Synchronization in Distributed Systems
di: Dissanayake, Chandeepa, et al.
Pubblicazione: (2024)

Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
di: Fuchs, Marc, et al.
Pubblicazione: (2025)

Gathering Semi-Synchronously Scheduled Two-State Robots
di: Otaka, Kohei, et al.
Pubblicazione: (2024)

Content-Oblivious Leader Election in 2-Edge-Connected Networks
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction
di: Chalopin, Jérémie, et al.
Pubblicazione: (2024)

Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition
di: Meir, Or
Pubblicazione: (2023)

Method for determining the acceleration of a parallel specialised computer system based on Amdahl's law
di: Filipchenko, Aleksandr S.
Pubblicazione: (2024)

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
di: Chalopin, Jérémie, et al.
Pubblicazione: (2024)

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

PoSME: Proof of Sequential Memory Execution via Latency-Bound Pointer Chasing with Causal Hash Binding
di: Condrey, David L.
Pubblicazione: (2026)

Nakamoto Consensus under Bounded Processing Capacity
di: Kiffer, Lucianna, et al.
Pubblicazione: (2023)

Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election
di: Chang, Yi-Jun, et al.
Pubblicazione: (2025)

Multiparty equality in the local broadcast model
di: Esperet, Louis, et al.
Pubblicazione: (2025)

Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
di: Kaur, Tanvir, et al.
Pubblicazione: (2024)

A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
di: Austin, Henry, et al.
Pubblicazione: (2025)

Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks
di: Sadhukhan, Abhijit, et al.
Pubblicazione: (2026)