Average Case Analysis of Algorithms on Sequences
Published on 14. October 2011
576 pages
978-1-118-03102-5 (ISBN)
Description
A timely book on a topic that has witnessed a surge of interestover the last decade, owing in part to several novel applications,most notably in data compression and computational molecularbiology. It describes methods employed in average case analysis ofalgorithms, combining both analytical and probabilistic tools in asingle volume.
* Tools are illustrated through problems on words with applicationsto molecular biology, data compression, security, and patternmatching.
* Includes chapters on algorithms and data structures on words,probabilistic and analytical models, inclusion-exclusionprinciples, first and second moment methods, subadditive ergodictheorem and large deviations, elements of information theory,generating functions, complex asymptotic methods, Mellin transformand its applications, and analytic poissonization anddepoissonization.
* Written by an established researcher with a strong internationalreputation in the field.
Reviews / Votes
"Surveying the major techniques of average case analysis, thisgraduate textbook presents both analytical methods used forwell-structured algorithms and probabilistic methods used for morestructurally complex algorithms." (SciTech Book News, Vol. 25, No.3, September 2001) "...contains a comprehensive treatment on probabilistic,combinatorial, and analytical techniques and methods...treatment isclear, rigorous, self-contained, with many examples and exercises."(Zentralblatt MATH Vol. 968, 2001/18) "This well-organized book...is certainly useful...It is a valuablesource for a deeper and more precise understanding of the behaviorsof algorithms on sequences." (Mathematical Reviews, 2002f)More details
Other editions
Additional editions
Szpankowski
Average Case Analysis of Algorithms on Sequences
Software
10/2011
Wiley
€253.75
No shipping information available
Wojciech Szpankowski
Average Case Analysis of Algorithms on Sequences
Book
04/2001
Wiley
€218.50
Shipment within 10-20 days
Person
WOJCIECH SZPANKOWSKI, PhD, is Professor of Computer Science at Purdue University and has held visiting research positions at the Technical University of Gdansk, McGill University, INRIA, the Technical University of Vienna, University of Witwatersrand, Hewlett-Packard Laboratories, and Stanford University. He is the author of over 100 scientific publications in the areas of analysis of algorithms, information theory, performance evaluation of computer networks, stability of distributed systems, and queueing theory.
Content
Foreword.
Preface.
Acknowledgments.
PROBLEMS ON WORDS.
Data Structures and Algorithms on Words.
Probabilistic and Analytical Models.
PROBABILISTIC AND COMBINATORIAL TECHNIQUES.
Inclusion-Exclusion Principle.
The First and Second Moment Methods.
Subadditive Ergodic Theorem and Large Deviations.
Elements of Information Theory.
ANALYTIC TECHNIQUES.
Generating Functions.
Complex Asymptotic Methods.
Mellin Transform and Its Applications.
Analytic Poissonization and Depoissonization.
Bibliography.
Index.
