Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox
暫譯: 序列與並行演算法及資料結構：基本工具箱
Sanders, Peter, Mehlhorn, Kurt, Dietzfelbinger, Martin
- 出版商: Springer
- 出版日期: 2019-09-11
- 售價: $2,230
- 貴賓價: 9.5 折 $2,119
- 語言: 英文
- 頁數: 509
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 3030252086
- ISBN-13: 9783030252083
-
相關分類:
Algorithms-data-structures
海外代購書籍(需單獨結帳)
商品描述
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. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms.
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.
商品描述(中文翻譯)
這本教科書是對於有效組織和檢索數據的基本工具箱的簡明介紹，涵蓋了圖形問題的關鍵算法，以及建模、理解和解決算法問題的通用技術。作者旨在實現簡單性與效率、理論與實踐、經典結果與前沿研究之間的平衡。各章節涵蓋了數組和鏈表、哈希表和關聯數組、排序和選擇、優先隊列、排序序列、圖形表示、圖形遍歷、最短路徑、最小生成樹、優化、集體通信與計算以及負載平衡。作者還討論了算法工程、內存層次結構、算法庫和算法認證等重要問題。這本書超越了早期相關書籍中的順序算法和數據結構，考慮到解決現代性能關鍵應用所需的並行處理的範式轉變，以及這對算法教學的影響。
本書適合熟悉編程和基本數學語言的本科生、研究生和專業人士。大多數章節具有相同的基本結構：作者討論一個在現實生活中出現的問題，說明最重要的應用，然後以盡可能非正式的方式和必要的正式性介紹簡單的解決方案，以便讀者真正理解當前的問題。隨著他們進入更高級和可選的問題，他們的方式逐漸引導到更數學化的處理，包括定理和證明。這本書包含了許多例子、圖片、非正式解釋和練習，實現註釋則介紹了在 C++ 和 Java 等語言中的乾淨、高效的實現。
作者簡介
Peter Sanders is a professor of computer science at the Karlsruhe Institute of Technology. He is a leading researcher in the area of theoretical and experimental algorithm analysis, in particular related to efficient algorithms for parallel processing and communication in networks. He won the Gottfried Wilhelm Leibniz Prize of the German Research Foundation in 2012.
Kurt Mehlhorn has been a professor of computer science at Saarland University since 1975, and a director of the Max Planck Institute for Informatics in Saarbrücken. He was appointed a Fellow of the ACM (1999) "for important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms." He has coauthored over 250 refereed conference papers and journal articles, in collaboration with 200 researchers. He received the Gottfried Wilhelm Leibniz Prize of the German Research Foundation in 1987 and the Konrad Zuse Medal of the German Society for Informatics in 1995.
Martin Dietzfelbinger is a professor of computer science at the Ilmenau University of Technology. His research interests include complexity theory and algorithms, in particular the design and analysis of randomized data structures and algorithms, hash functions, applications of hashing, sorting, algorithm engineering, and the complexity of parallel and distributed computation.
Roman Dementiev is a senior staff application engineer in the Intel Architecture, Graphics and Software group. He holds a Ph.D. in computer science from Saarland University. His interests include parallel algorithms, compute accelerators and processor architectures, hardware transactional memory, hardware performance and power monitoring, memory hierarchies, software libraries, and scalable software architectures.
The authors have considerable experience teaching on the topic of algorithms and working on related industrial projects.
作者簡介(中文翻譯)
彼得·桑德斯（Peter Sanders）是卡爾斯魯厄理工學院的計算機科學教授。他是理論和實驗算法分析領域的領先研究者，特別是在與並行處理和網絡通信相關的高效算法方面。他於2012年獲得德國研究基金會的戈特弗里德·威廉·萊布尼茨獎。
庫爾特·梅爾霍恩（Kurt Mehlhorn）自1975年以來一直擔任薩爾蘭大學的計算機科學教授，並且是薩爾布呂肯的馬克斯·普朗克計算機科學研究所的主任。他於1999年被任命為ACM的會士，以表彰他在複雜性理論以及組合和幾何算法的設計、分析和實踐方面的重要貢獻。他與200位研究人員合作，共同發表了超過250篇經過審核的會議論文和期刊文章。他於1987年獲得德國研究基金會的戈特弗里德·威廉·萊布尼茨獎，並於1995年獲得德國計算機學會的康拉德·祖斯獎章。
馬丁·迪茨費爾賓格（Martin Dietzfelbinger）是伊爾門瑙科技大學的計算機科學教授。他的研究興趣包括複雜性理論和算法，特別是隨機數據結構和算法的設計與分析、哈希函數、哈希的應用、排序、算法工程以及並行和分佈計算的複雜性。
羅曼·德門捷夫（Roman Dementiev）是英特爾架構、圖形和軟體組的高級應用工程師。他擁有薩爾蘭大學的計算機科學博士學位。他的興趣包括並行算法、計算加速器和處理器架構、硬體事務記憶體、硬體性能和功耗監控、記憶體層次結構、軟體庫以及可擴展的軟體架構。
這些作者在算法主題的教學和相關工業項目方面擁有豐富的經驗。
