Logo

Average Case Analysis of Algorithms on Sequences

Large book cover: Average Case Analysis of Algorithms on Sequences

Average Case Analysis of Algorithms on Sequences
by

Publisher: Wiley-Interscience
ISBN/ASIN: 047124063X
ISBN-13: 9780471240631
Number of pages: 576

Description:
A timely book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications, most notably in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms, combining both analytical and probabilistic tools in a single volume.

Home page url

Download or read it online for free here:
Download link
(multiple PS files)

Similar books

Book cover: A Practical Introduction to Data Structures and Algorithm AnalysisA Practical Introduction to Data Structures and Algorithm Analysis
by - Virginia Tech
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.
(7756 views)
Book cover: AlgorithmsAlgorithms
by - Addison-Wesley Professional
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.
(4784 views)
Book cover: Knapsack Problems: Algorithms and Computer ImplementationsKnapsack Problems: Algorithms and Computer Implementations
by - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
(11127 views)
Book cover: Lecture Notes on Bucket AlgorithmsLecture Notes on Bucket Algorithms
by - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
(6694 views)