论文信息 - Restricted universe data structures

Restricted universe data structures

Restricted universe data structures and their algorithms augment our knowledge of the behavior of standard data structures. Understanding the increase in asymptotic efficiency when restricting the universe of possible keys helps us to realize the limits of the common data structures, such as balanced binary trees. This paper first introduces the principles of restricted universe data structures and then empirically compares stratified trees and AVL trees in the connection with a simple algorithmic problem.

Erkki Mäkinen | Markku Siermala

[1] Peter van Emde Boas,et al. Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[2] Kurt Mehlhorn,et al. Data structures and algorithms. Volume 1 : Sorting and searching , 1984 .

[3] Gaston H. Gonnet,et al. Handbook Of Algorithms And Data Structures , 1984 .

[4] Kurt Mehlhorn,et al. Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space , 1990, Information Processing Letters.

[5] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[6] John Beidler,et al. Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[7] R. Karlsson. Algorithms in a restricted universe , 1985 .

[8] David Gries,et al. The Science of Programming , 1981, Text and Monographs in Computer Science.

[9] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .

[10] Michael L. Fredman,et al. Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[11] David Thomas,et al. The Art in Computer Programming , 2001 .

[12] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .