Peter Davies-Peck
Peter Davies-Peck
Beeping models are models for networks of weak devices, such as sensor networks or biological networks. In these networks, nodes are allowed to communicate only via emitting beeps: unary pulses of energy. Listening nodes have only the capab...
Orestis Alpos,Christian Cachin,Björn Tackmann et al.
Orestis Alpos et al.
Quorum systems are a key abstraction in distributed fault-tolerant computing for capturing trust assumptions. They can be found at the core of many algorithms for implementing reliable broadcasts, shared memory, consensus and other problems...
Near-optimal distributed dominating set in bounded arboricity graphs [0.03%]
arboretum属性图中的近似分布式支配集算法
Michal Dory,Mohsen Ghaffari,Saeed Ilchi
Michal Dory
We describe a simple deterministic O ( ε - 1 log Δ ) round distributed algorithm for ( 2 α + 1 ) ( 1 + ε ) approximation of minimum weighted dominating set on graphs with arboricity at most α . Here Δ denote...
Artur Czumaj,Peter Davies-Peck,Merav Parter
Artur Czumaj
In this paper, we study the power and limitations of component-stable algorithms in the low-space model of massively parallel computation (MPC). Recently Ghaffari, Kuhn and Uitto (FOCS 2019) introduced the class of component-stable low-spac...
Equivalence classes and conditional hardness in massively parallel computations [0.03%]
大规模并行计算中的等价类和条件硬度
Danupon Nanongkai,Michele Scquizzato
Danupon Nanongkai
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of cl...
Matthias Volk,Borzoo Bonakdarpour,Joost-Pieter Katoen et al.
Matthias Volk et al.
Randomization is a key concept in distributed computing to tackle impossibility results. This also holds for self-stabilization in anonymous networks where coin flips are often used to break symmetry. Although the use of randomization in se...
Rachid Guerraoui,Petr Kuznetsov,Matteo Monti et al.
Rachid Guerraoui et al.
Many blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preven...
Mohsen Ghaffari,Juho Hirvonen,Fabian Kuhn et al.
Mohsen Ghaffari et al.
We present a randomized distributed algorithm that computes a Δ -coloring in any non-complete graph with maximum degree Δ ≥ 4 in O ( log Δ ) + 2 O ( log log n ) rounds, as well as a randomized algorithm that comput...
Javier Esparza,Stefan Jaax,Mikhail Raskin et al.
Javier Esparza et al.
Population protocols (Angluin et al. in PODC, 2004) are a model of distributed computation in which indistinguishable, finite-state agents interact in pairs to decide if their initial configuration, i.e., the initial number of agents in eac...
Laurent Feuilloley,Pierre Fraigniaud,Juho Hirvonen et al.
Laurent Feuilloley et al.
Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed o...