Advanced Data Structures Spring Semester, 1993/4 (-5)
Download:
|
|
unknown authors
ftp://ftp.math.tau.ac.il/pub/mendel/ads45.ps.gz
Add To MetaCart
Abstract:
The Stratified--Tree is a data structure, based upon a hierarchically decomposed tree, which enables us to manipulate, for example, a queue with priorities that are selected from the interval f1; : : : ; ng. The presented data structure works with a worst case processing time of O(log log n) per instruction, and with linear storage requirements.
Citations
| 133 | Design and implementation of an efficient priority queue – Boas, Kaas, et al. - 1977 |
| 1 | Preserving Order in a Forest in less than Logarithmic Time and – v - 1977 |
