Average Case Analysis of Algorithms on Sequences

Wojciech Szpankowski

ISBN 10: 047124063X / ISBN 13: 9780471240631

Published by Wiley-Interscience April 2001, 2001

About this Item

Condition: 'VG+' Notes: Wiley-Interscience Series in Discrete Mathematics and Optimization. First signature binding slightly loose. Inscription to front flyleaf.

Seller Inventory # 1138142

Bibliographic Details

• Title: Average Case Analysis of Algorithms on Sequences
• Publisher: Wiley-Interscience April 2001
• Publication Date: 2001
• Language: English
• ISBN 10: 047124063X
• ISBN 13: 9780471240631
• Binding: Hardcover
• Condition: Very Good
• Seller catalogs:
  • JS 60/40 ; NEAT STUFF: MATH

About this title

Synopsis

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.

About the Author

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.