Overview
A central topic in any computer science curriculum
Author considers probabilistic methods as being fundamental for the construction of simple and e?cient algorithms
Suitable for undergraduate and graduate students of computer science, mathematics, and engineering
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (6 chapters)
Keywords
About this book
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.
Authors and Affiliations
About the author
Bibliographic Information
Book Title: Algorithms and Data Structures
Book Subtitle: Foundations and Probabilistic Methods for Design and Analysis
Authors: Helmut Knebl
DOI: https://doi.org/10.1007/978-3-030-59758-0
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2020
Hardcover ISBN: 978-3-030-59757-3Published: 01 November 2020
Softcover ISBN: 978-3-030-59760-3Published: 02 November 2021
eBook ISBN: 978-3-030-59758-0Published: 31 October 2020
Edition Number: 1
Number of Pages: XI, 349
Topics: Algorithm Analysis and Problem Complexity, Algorithms