Stock photo: cover may vary
Average Case Analysis of Algorithms on Sequences (Wiley Series in Discrete Mathematics and Optimization) Hardback - 0000 - 1st Edition
by Szpankowski, Wojciech
- Used
- Hardback
- first
A$383.91
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Standard delivery: 5 to 10 days
Dropship order
Ships from Ergodebooks (Texas, United States)
Details
- Title Average Case Analysis of Algorithms on Sequences (Wiley Series in Discrete Mathematics and Optimization)
- Author Szpankowski, Wojciech
- Binding Hardback
- Edition number 1st
- Edition 1
- Condition Used: Good
- Pages 576
- Volumes 1
- Language ENG
- Publisher Wiley
- Publication date 0000-00-00
- Illustrated Yes
- Features Bibliography, Illustrated, Index
- Bookseller's Inventory # SONG047124063X
- ISBN 9780471240631 / 047124063X
- Weight 2.02 lbs (0.92 kg)
- Dimensions 9.56 x 6.43 x 1.24 in (24.28 x 16.33 x 3.15 cm)
- Size 6.40x1.22x9.37
- Category Mathematics
- Library of Congress subjects Computer algorithms
- Library of Congress Catalogue Number 00042253
- Dewey Decimal Code 005.1
- Quantity available 1
About Ergodebooks Texas, United States
Biblio member since 2005
Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.
We have 30 day return policy.
Reader reviews for Average Case Analysis of Algorithms on Sequences (Wiley Series in Discrete Mathematics and Optimization)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
First line
In this book we choose one facet of the theory of algorithms, namely data structures and algorithms on sequences (strings, words) to illustrate probabilistic, combinatorial, and analytic techniques of analysis.
From the rear cover
Comprehensive presentation of both analytic and probabilistic techniques As a comprehensive survey of the major techniques of average case analysis, this work presents, in detail, both analytic methods used for well-structured algorithms and probabilistic methods used for more structurally complex algorithms. In particular, the applications in the book use algorithms that focus on data structures on sequences, also called strings, which are widely used in computer science, computational biology, and information theory. Specific techniques covered include the inclusion-exclusion principle, the first and second moment methods, the random coding technique, the subadditive ergodic theorem, large deviations, generating functions, complex asymptotic methods, the Mellin transform, and analytic poissonization and depoissonization. Each method is clearly explained and accompanied by related applications and problems involving algorithms on sequences. Important features of the book include:
* A foreword by well-known expert Dr. Philippe Flajolet, INRIA, France
* Presentation of complex analysis used to solve discrete and probabilistic problems on sequences
* Discussions of Lempel-Ziv data compression-schemes, the string edit problem, pattern matching algorithms, many variations of digital trees, the leader election algorithm, and more
* A chapter devoted to tools used in information theory, particularly the random coding technique and pattern matching approach to data compression
* Application sections in each chapter that illustrate the methods covered
* An extensive bibliography
* A foreword by well-known expert Dr. Philippe Flajolet, INRIA, France
* Presentation of complex analysis used to solve discrete and probabilistic problems on sequences
* Discussions of Lempel-Ziv data compression-schemes, the string edit problem, pattern matching algorithms, many variations of digital trees, the leader election algorithm, and more
* A chapter devoted to tools used in information theory, particularly the random coding technique and pattern matching approach to data compression
* Application sections in each chapter that illustrate the methods covered
* An extensive bibliography
Media reviews
Citations
- Scitech Book News, 09/01/2001, Page 36
