Byzantine Gathering in Networks with Authenticated Whiteboards
From MaRDI portal
Publication:2980903
DOI10.1007/978-3-319-53925-6_9zbMATH Open1485.68022OpenAlexW2587152265MaRDI QIDQ2980903FDOQ2980903
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 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
- Byzantine gathering in networks
- Time versus space trade-offs for rendezvous in trees
- Byzantine Gathering in Networks with Authenticated Whiteboards
Cited In (2)
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)