Average Case Analysis of Algorithms on Sequences
by Wojciech Szpankowski
Publisher: Wiley-Interscience 2001
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.
Download or read it online for free here:
Download link
(multiple PS files)
Similar books
The Design of Approximation Algorithmsby D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(15984 views)
Data Structures and Algorithm Analysis in Javaby Clifford A. Shaffer - Dover Publications
A comprehensive treatment focusing on the creation of efficient data structures and algorithms, explaining how to select the data structure best suited to specific problems. It uses Java programming language and is suitable for second-year courses.
(19791 views)
Think Data Structuresby Allen B. Downey - Green Tea Press
This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.
(11914 views)
Data Structures and Algorithmsby John Morris
The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.
(14990 views)