Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet (Q2715788)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet |
scientific article; zbMATH DE number 1600428
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet |
scientific article; zbMATH DE number 1600428 |
Statements
28 May 2001
0 references
complexity of algorithms
0 references
Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet (English)
0 references
Sequences are fundamental for mathematics and computer science. This book contains a comprehensive treatment of probabilistic, combinatorial, and analytical techniques and methods in the study of average case complexity of algorithms on sequences. The treatment is clear, rigorous, self-contained, with many examples and exercises.
0 references
