The firing squad problem revisited

DOI10.1016/J.TCS.2019.07.023zbMATH Open1430.68015OpenAlexW2964137294WikidataQ127490090 ScholiaQ127490090MaRDI QIDQ2326403FDOQ2326403

Authors: Bernadette Charron-Bost, Shlomo Moran 

Publication date: 7 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8519/

Recommendations

• The firing squad problem revisited
• An efficient solution of the firing mob problem
• The Distributed Firing Squad Problem
• Smaller solutions for the firing squad
• On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem

zbMATH Keywords

randomized algorithmsdistributed algorithmsdynamic graphsfiring squadasynchronous start

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• Concentration inequalities. A nonasymptotic theory of independence
• Distributed computation in dynamic networks
• The firing squad synchronization problem for graphs
• Graph theory
• Authenticated Algorithms for Byzantine Agreement
• Early stopping in Byzantine agreement
• Reaching Agreement in the Presence of Faults
• Token dissemination in geometric dynamic networks
• The Heard-Of model: computing in distributed systems with benign faults
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Coordinated consensus in dynamic networks
• Distributed Anonymous Discrete Function Computation
• A generalized firing squad problem
• Title not available (Why is that?)
• Computing separable functions via gossip
• The Distributed Firing Squad Problem
• An optimal self-stabilizing firing squad
• Near-optimal self-stabilising counting and firing squads
• Time to change: on distributed computing in dynamic networks (keynote)
• An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking

Cited In (8)

• An optimal self-stabilizing firing squad
• Synchronization modulo \(P\) in dynamic networks
• The wake up and report problem is time-equivalent to the firing squad synchronization problem
• An efficient solution of the firing mob problem
• The Distributed Firing Squad Problem
• Synchronization Modulo k in Dynamic Networks
• Self-stabilizing systems in spite of high dynamics
• The firing squad problem revisited

This page was built for publication: The firing squad problem revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326403)