Adobe PDF (2.58 MB)
Table of Contents - Adobe PDF (191.14 kB)
Brochure
Download
User comments
Similar Books
Title Details:
Algorithmic theory of distributed computing
Authors: Markou, Evripidis
Kranakis, Evangelos
Pagourtzis, Aristeidis
Krizanc, Danny
Reviewer: Nikolopoulos, Stavros
Subject: MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > COMBINATORICS
MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE
MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > COMPUTATIONAL SCIENCE
Keywords:
Distributed algorithms
Mobile agents
Network security
Computational complexity
Approximation algorithms
The meeting problem
The black hole problem
Description:
Abstract:
This book is addressed to undergraduate and graduate students in computer science and mathematics who are studying topics related to algorithm design and analysis. It can be used by both those unfamiliar with the field and advanced scientists in the areas of Theoretical Computer Science, particularly in the fields of Algorithm Design, Computation Theory, Artificial Intelligence, and Robotics. Readers will find in this book the necessary material to understand concepts related to: - Distributed algorithms. - Mobile agents. - Complexity of goods in distributed computing. - Timing models for distributed models. - Basic problems and distributed algorithms. - Problem reductions, correctness proofs, and complexity analysis of algorithms. - Approximation with quality guarantees for difficult (NP-hard) problems. - Network and agent security issues. Particular emphasis is placed on the presentation and understanding of theoretical models. With these models we can design optimal distributed algorithms that solve realistic problems and it is also possible to highlight the advantages of distributed methods over parallel and serial algorithms. The book focuses particularly on problem solving using mobile agents. Extensive reference is made to the applications of the problem models presented. The algorithms are presented in pseudolanguage, while the proofs of correctness and complexity of the algorithms, as well as the proofs of negative results, are given in a standard manner so that undergraduate students can easily follow them. At the end of each chapter, there are comments and bibliographical references, as well as exercises that help to understand thouroughly not only the methods of designing distributed algorithms but also their analysis.
Type: Undergraduate textbook
Creation Date: 2015
Item Details:
ISBN 978-960-603-504-3
License: http://creativecommons.org/licenses/by-nc-nd/3.0/gr
DOI http://dx.doi.org/10.57713/kallipos-476
Handle http://hdl.handle.net/11419/5769
Bibliographic Reference: Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. (2015). Algorithmic theory of distributed computing [Undergraduate textbook]. Kallipos, Open Academic Editions. https://dx.doi.org/10.57713/kallipos-476
Language: Greek
Consists of:
1. Parallel and distributed computing
2. Fundamental problems and algorithms with immobile agents
3. Distributed computing with mobile agents
4. The problem of two mobile agents meeting
5. The multi-agent meeting problem
6. Discovery of hostile nodes in rings and trees
7. Hostile nodes in graphs and memoryless
8. Reliable communication in distributed networks
9. The meeting problem in other scenarios
10. Current and future research directions
Number of pages 217
Publication Origin: Kallipos, Open Academic Editions
You can also view
User comments
There are no published comments available!