Data Structures & Orthogonal Polynomials
- 216 Downloads
In this Chapter, we first present the analysis involved in finding the behavior of data structures in Knuth’s model. Then we indicate some features of a finite universe model, which has perhaps a more realistic flavor than the models first discussed. Then we con sider mutual exclusion. This models a system of parallel processes accessed, at random, by various users. Each process can be accessed by only one user at a time, hence the description. A probabilistic model again leads to recurrences of the type studied in this Chapter. We conclude with some remarks on a general approach to duality, relating the space-time recurrence with the dual action of the operator of multiplication by X.
Unable to display preview. Download preview PDF.