In amortized analysis of data structures, it is standard to assume
that initially the structure is empty. Usually, results cannot
be established otherwise.
In this paper, we investigate the possibilities of establishing
such results for initially non-empty multi-way trees.
- On the Existence and Construction of Non-Extreme (a,b)-Trees.
- Lars Jacobsen, Kim S. Larsen, and Morten N. Nielsen.
Information Processing Letters, 84(2): 69-73, 2002.
The publication is available from ScienceDirect (subscription may be required).
Other publications by the author.
Last modified: Wed May 15 08:23:30 CEST 2013
Kim Skak Larsen