株式会社極東書店トップ ＞ 商品一覧 ＞ Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis. 2020 ed.
商品詳細
Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis. 2020 ed.
・ISBN 978-3-030-59757-3 hard EUR 74.99
￥20,044.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Knebl, Helmut, |
|---|---|
| 出版社 | (Springer Nature Switzerland AG, SZ) |
| 出版年月 | 2020 |
| ページ数 | 349 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A03-41205＞ |
解説
This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application.
This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.
This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.