BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis

Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis

Algorithms and Data Structures: Foundations and Probabilistic Methods for Design
Stock photo: cover may vary

Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis Paperback - 2021

by Helmut Knebl

Add to wish list
  • New
  • Paperback
  • first
New

Description

Springer, 2021. 1. Paperback. New.
Ask the seller a question Add to wish list
A$220.66
A$21.64 Delivery to USA
Standard delivery: 20 to 30 days
More delivery options
Ships from Sanctum Books (Delhi, India)

Details

About Sanctum Books Delhi, India

Biblio member since 2010

We are leading publishers, booksellers, distributors, importers, and exporters. We carry a large selection of books on varied subjects. Do place your valued order or let us know your requirement via email.

Terms of Sale:

30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Books are shipped by Registered Air Mail or DHL/FedEx/Aramex. Additional shipping charges may be required for multi-volume sets.

Browse books from Sanctum Books

Reader reviews for Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis

From the rear cover

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.

About the author

Prof. Dr. Helmut Knebl is a researcher and lecturer in the Faculty of Informatics of the Technische Hochschule Nrnberg 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.
tracking-