Skip to main content
SpringerLink
Log in

Algorithms and Data Structures

Foundations and Probabilistic Methods for Design and Analysis

  • Textbook
  • © 2020

Overview

Authors:
  1. Helmut Knebl

    1. Fakultät Informatik, Technische Hochschule Nürnberg, Nürnberg, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 84.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Introduction

    • Helmut Knebl
    Pages 1-69

  3. Sorting and Searching

    • Helmut Knebl
    Pages 71-104

  4. Hashing

    • Helmut Knebl
    Pages 105-128

  5. Trees

    • Helmut Knebl
    Pages 129-204

  6. Graphs

    • Helmut Knebl
    Pages 205-241

  7. Weighted Graphs

    • Helmut Knebl
    Pages 243-305

  8. Back Matter

    Pages 307-349
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Fakultät Informatik, Technische Hochschule Nürnberg, Nürnberg, Germany

    Helmut Knebl

About the author

Prof. Dr. Helmut Knebl is a researcher and lecturer in the Faculty of Informatics of the Technische Hochschule Nürnberg Georg Simon Ohm, where he has taught courses on the topic of this book to students of computer science, media, and business informatics at bachelor's and master's levels. He is the coauthor of the successful textbook Introduction to Cryptography, now in its 3rd edition.

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

Publish with us

Policies and ethics

Back to top

Search

Navigation