Byzantine Gathering in Networks with Authenticated Whiteboards
From MaRDI portal
Publication:2980903
DOI10.1007/978-3-319-53925-6_9zbMath1485.68022OpenAlexW2587152265MaRDI QIDQ2980903
Fukuhito Ooshita, Masashi Tsuchida, 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
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (2)
Byzantine Gathering in Networks with Authenticated Whiteboards ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers
Cites Work
- How to meet in anonymous network
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Time versus space trade-offs for rendezvous in trees
- Byzantine gathering in networks
- Deterministic rendezvous in graphs
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Byzantine Gathering in Networks with Authenticated Whiteboards
- Authenticated Algorithms for Byzantine Agreement
- Gathering Despite Mischief
This page was built for publication: Byzantine Gathering in Networks with Authenticated Whiteboards
