Average Case Analysis of Algorithms on Sequences

Inbunden, Engelska, 2001

Del 50 i serien Wiley Series in Discrete Mathematics and Optimization

2 312 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.* Tools are illustrated through problems on words with applications to molecular biology, data compression, security, and pattern matching.* Includes chapters on algorithms and data structures on words, probabilistic and analytical models, inclusion-exclusion principles, first and second moment methods, subadditive ergodic theorem and large deviations, elements of information theory, generating functions, complex asymptotic methods, Mellin transform and its applications, and analytic poissonization and depoissonization.* Written by an established researcher with a strong international reputation in the field.

Produktinformation

Utgivningsdatum:2001-04-24
Mått:163 x 238 x 31 mm
Vikt:923 g
Format:Inbunden
Språk:Engelska
Serie:Wiley Series in Discrete Mathematics and Optimization
Antal sidor:576
Förlag:John Wiley & Sons Inc
ISBN:9780471240631

Utforska kategorier

Mer om författaren

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.

Recensioner i media

"Surveying the major techniques of average case analysis, this graduate textbook presents both analytical methods used for well-structured algorithms and probabilistic methods used for more structurally complex algorithms." (SciTech Book News, Vol. 25, No. 3, September 2001)"...contains a comprehensive treatment on probabilistic, combinatorial, and analytical techniques and methods...treatment is clear, rigorous, self-contained, with many examples and exercises." (Zentralblatt MATH Vol. 968, 2001/18)"This well-organized book...is certainly useful...It is a valuable source for a deeper and more precise understanding of the behaviors of algorithms on sequences." (Mathematical Reviews, 2002f)

Innehållsförteckning

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.