| 000 | 02875nam a22004815i 4500 | ||
|---|---|---|---|
| 001 | 978-3-030-59758-0 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125042.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 201031s2020 sz | s |||| 0|eng d | ||
| 020 |
_a9783030597580 _9978-3-030-59758-0 |
||
| 024 | 7 |
_a10.1007/978-3-030-59758-0 _2doi |
|
| 050 | 4 | _aQA9.58 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a005.13 _223 |
| 100 | 1 |
_aKnebl, Helmut. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
| 245 | 1 | 0 |
_aAlgorithms and Data Structures _h[electronic resource] : _bFoundations and Probabilistic Methods for Design and Analysis / _cby Helmut Knebl. |
| 250 | _a1st ed. 2020. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020. |
|
| 300 |
_aXI, 349 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 505 | 0 | _aIntroduction -- Sorting and Searching -- Hashing -- Trees -- Graphs -- Weighted Graphs -- App. A, Probabilities -- App. B, Mathematical Terminology and Useful Formulas -- References -- Symbols -- Index. | |
| 520 | _aThis 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. | ||
| 650 | 0 | _aAlgorithms. | |
| 650 | 1 | 4 | _aDesign and Analysis of Algorithms. |
| 650 | 2 | 4 | _aAlgorithms. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030597573 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030597597 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030597603 |
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-59758-0 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 942 | _cSPRINGER | ||
| 999 |
_c173694 _d173694 |
||