| A.L. Buchsbaum. Data-structural Bootstrapping and Catenable Deques. PhD Thesis, Dept. of Computer Science, Princeton University, 1993. |
....cascading carries: Such a variant based on skew binary numbers (Myers, 1983) is given in (Brodal Okasaki, 1996) In fact, loc.cit. presents an optimal implementation of priority queues. Constant worst case running time for ( is achieved using a technique called data structural bootstrapping (Buchsbaum, 1993). In essence ( is reduced to insert by allowing queues to contain other queues. 9 Acknowledgements Thanks are due to Michael Beetz, Thomas Bode, Martina Doelp, Ulrike Griefahn, Anja Hartmann, Jurgen Kalinski, and an anonymous referee for their helpful comments on a draft version of this ....
Buchsbaum, Adam L. 1993 (June). Data-structural bootstrapping and catenable deques.
....of the general technique. Other examples of the use of these technique are those in [Oka95a] and [Mye83] where implementations of random access lists are described in analogy to skew binary number systems. 4. Data structural bootstrapping. These technique was described in Buchsbaum s thesis [Buc93]. It consists of two basic ideas: Structural Abstraction and Structural Decomposition. Structural abstraction is typically used to provide efficient catenation for a data type that do not support it. This can be done by inserting the data type as an element of its own. Examples of this technique ....
Adam Louis Buchsbaum. Data-structural Bootstrapping and catenable deques. PhD thesis, Department of Computer Science, Princeton University, June 1993.
No context found.
A.L. Buchsbaum. Data-structural Bootstrapping and Catenable Deques. PhD Thesis, Dept. of Computer Science, Princeton University, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC