Sequential and Parallel Algorithms and Data Structures
«
“The style of the book is accessible and is suitable for a wide range of audiences, from mathematicians and computer scientists to researchers from other fields who would like to use parallelised approaches in their research.” (Irina Ioana Mohorianu, zbMATH 1445.68003, 2020)
»
This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. Les mer
Logg inn for å se din bonus
The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java.
Detaljer
- Forlag
- Springer Nature Switzerland AG
- Innbinding
- Paperback
- Språk
- Engelsk
- Sider
- 509
- ISBN
- 9783030252113
- Utgivelsesår
- 2020
- Format
- 24 x 16 cm
Anmeldelser
«
“The style of the book is accessible and is suitable for a wide range of audiences, from mathematicians and computer scientists to researchers from other fields who would like to use parallelised approaches in their research.” (Irina Ioana Mohorianu, zbMATH 1445.68003, 2020)
»