chapter 1 Introduction -- chapter 2 Counting -- chapter 3 Symbolic Calculus -- chapter 4 Languages and Their Generating Functions -- chapter 5 Probability in Algorithmics -- chapter 6 Functional Transforms -- chapter 7 Nonuniform Pólya Urn Schemes -- chapter 8 Nonuniform Data Models -- chapter 9 Sorting Nonuniform Data -- chapter 10 Recursive Trees -- chapter 11 Series-Parallel Graphs.

Algorithmics of Nonuniformity is a solid presentation about the analysis of algorithms, and the data structures that support them. Traditionally, algorithmics have been approached either via a probabilistic view or an analytic approach. The authors adopt both approaches and bring them together and benefit from the advantage of each approach. The text examines algorithms that are designed to handle general data—sort any array, find the median of any numerical set, and identify patterns in any setting. At the same time, it evaluates "average" performance, "typical" behavior, or in mathematical terms, the expectations of the random variables that describe their operations.