Average Case Analysis of Algorithms on Sequences
★★★★★
★★★★★
Regular price
€228.10
A01=Wojciech Szpankowski
algorithms
analytic
applications
Author_Wojciech Szpankowski
average
book
case analysis
Category=PBK
Category=PBT
Category=PBV
Category=PBW
Category=UYA
complex
comprehensive presentation
computer science
data
eq_computing
eq_isMigrated=1
eq_non-fiction
focus
major
methods
sequences
strings
structurally
structures
survey
techniques
use
wellstructured
Product details
- ISBN 9780471240631
- Weight: 923g
- Dimensions: 163 x 238mm
- Publication Date: 24 Apr 2001
- Publisher: John Wiley & Sons Inc
- Publication City/Country: US
- Product Form: Hardback
Delivery/Collection within 10-20 working days
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
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.
* 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.
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.
Qty: