Average Case Analysis of Algorithms on Sequences
Author:   Wojciech Szpankowski (Purdue University)
Publisher:   John Wiley & Sons Inc
ISBN:  

9780471240631


Pages:   576
Publication Date:   24 April 2001
Format:   Hardback
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Our Price $393.95 Quantity:  
Add to Cart

Share |

Average Case Analysis of Algorithms on Sequences


Add your own review!

Overview

Full Product Details

Author:   Wojciech Szpankowski (Purdue University)
Publisher:   John Wiley & Sons Inc
Imprint:   Wiley-Interscience
Dimensions:   Width: 16.30cm , Height: 3.10cm , Length: 23.80cm
Weight:   0.923kg
ISBN:  

9780471240631


ISBN 10:   047124063
Pages:   576
Publication Date:   24 April 2001
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

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.

Reviews

...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)


Author Information

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.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now