Average Case Analysis of Algorithms on Sequences

Wojciech Szpankowski (Purdue University)

$393.95

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Wiley-Interscience
02 April 2001

Calculus & mathematical analysis; Probability & statistics; Combinatorics & graph theory; Applied mathematics; Mathematical theory of computation

Series: Wiley Series in Discrete Mathematics and Optimization

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.

By: Wojciech Szpankowski (Purdue University)
Imprint: Wiley-Interscience
Country of Publication: United States
Dimensions: Height: 238mm, Width: 163mm, Spine: 31mm
Weight: 923g
ISBN: 9780471240631
ISBN 10: 047124063X
Series: Wiley Series in Discrete Mathematics and Optimization
Pages: 576
Publication Date: 02 April 2001
Audience: College/higher education , Professional and scholarly , Professional & Vocational , A / AS level , Further / Higher Education
Format: Hardback
Publisher's Status: Active

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.

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.

Reviews for Average Case Analysis of Algorithms on Sequences

...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) ...a textbook intended for graduate students...as well as a reference for researchers. (Quarterly of Applied Mathematics, Vol. LX, No. 2, June 2002)