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
Design and Analysis of Computer Algorithms
by David M. Mount - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
(18282 views)
by David M. Mount - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
(18282 views)
Problems on Algorithms, 2nd edition
by Ian Parberry, William Gasarch - Prentice Hall
A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.
(18553 views)
by Ian Parberry, William Gasarch - Prentice Hall
A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.
(18553 views)
Data Structures and Algorithms
by 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.
(14934 views)
by 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.
(14934 views)
Data Structures and Algorithms: Annotated Reference with Examples
by Granville Barnett, Luca Del Tongo - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.
(18538 views)
by Granville Barnett, Luca Del Tongo - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.
(18538 views)