Adobe PDF
(206.33 kB)
| Title Details: | |
|
Discovery of hostile nodes in rings and trees |
|
| Authors: |
Markou, Evripidis Kranakis, Evangelos Pagourtzis, Aristeidis Krizanc, Danny |
| Reviewer: |
Nikolopoulos, Stavros |
| Description: | |
| Abstract: |
Models of hostile nodes. The black hole problem. Algorithms for synchronous and asynchronous networks. Negative results. Algorithms for finite memoryless automata in rings and tori networks. Algorithms for Turing machines. Optimal and approximate algorithms.
|
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-nd/3.0/gr |
| Handle | http://hdl.handle.net/11419/5775 |
| Bibliographic Reference: | Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. (2015). Discovery of hostile nodes in rings and trees [Chapter]. In Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. 2015. Algorithmic theory of distributed computing [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/5775 |
| Language: |
Greek |
| Is Part of: |
Algorithmic theory of distributed computing |
| Publication Origin: |
Kallipos, Open Academic Editions |