Byzantine gathering in networks with authenticated whiteboards

DOI10.1007/978-3-319-53925-6_9zbMATH Open1485.68022OpenAlexW2587152265MaRDI QIDQ2980903FDOQ2980903

Authors: Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue 

Publication date: 5 May 2017

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=100219890

Recommendations

• Byzantine gathering in polynomial time
• Gathering despite mischief
• Gathering despite mischief

Mathematics Subject Classification ID

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

Cites Work

• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Deterministic rendezvous in graphs
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
• Delays induce an exponential memory gap for rendezvous in trees
• Gathering despite mischief
• How to meet in anonymous network
• Authenticated Algorithms for Byzantine Agreement
• Time versus space trade-offs for rendezvous in trees
• Byzantine gathering in networks with authenticated whiteboards

Cited In (2)

• Byzantine gathering in networks with authenticated whiteboards
• Wireless evacuation on \(m\) rays with \(k\) searchers

This page was built for publication: Byzantine gathering in networks with authenticated whiteboards

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