Sold Out
Book Categories |
Forword | ||
Preface | ||
Acknowledgments | ||
Pt. I | Problems on Words | |
1 | Data Structures and Algorithms on Words | 3 |
2 | Probabilistic and Analytical Models | 25 |
Pt. II | Probabilistic and Combinatorial Techniques | |
3 | Inclusion-Exclusion Principle | 51 |
4 | The First and Second Moment Methods | 73 |
5 | Subadditive Ergodic Theorem and Large Deviations | 106 |
6 | Elements of Information Theory | 149 |
Pt. III | Analytic Techniques | |
7 | Generating Functions | 213 |
8 | Complex Asymptotic Methods | 278 |
9 | Mellin Transform and Its Applications | 398 |
10 | Analytic Poissonization and Depoissonization | 442 |
Bibliography | 520 | |
Index | 543 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionAverage Case Analysis of Algorithms on Sequences
X
This Item is in Your InventoryAverage Case Analysis of Algorithms on Sequences
X
You must be logged in to review the productsX
X
X
Add Average Case Analysis of Algorithms on Sequences, While most algorithm designs are finalized toward worst case scenarios where they have to cope efficiently with unrealistic inputs, the average case solution is a probabilistic approach that allows for the possibility that a simple algorithm would suffice, Average Case Analysis of Algorithms on Sequences to the inventory that you are selling on WonderClubX
X
Add Average Case Analysis of Algorithms on Sequences, While most algorithm designs are finalized toward worst case scenarios where they have to cope efficiently with unrealistic inputs, the average case solution is a probabilistic approach that allows for the possibility that a simple algorithm would suffice, Average Case Analysis of Algorithms on Sequences to your collection on WonderClub |