The Joint Distribution of Elastic Buckets in Multiway Search Trees

This publication has 17 references indexed in Scilit:

• Page usage in a quadtree index
  BIT Numerical Mathematics, 1992
• Generalized Digital Trees and Their Difference—Differential Equations
  Random Structures & Algorithms, 1992
• On the height of randomm‐ary search trees
  Random Structures & Algorithms, 1990
• Performance of B/sup +/-trees with partial expansions
  IEEE Transactions on Knowledge and Data Engineering, 1989
• Some average measures in m-ary search trees
  Information Processing Letters, 1987
• Partial expansions for file organizations with an index
  ACM Transactions on Database Systems, 1987
• On the average internal path length of m-ary search trees
  Acta Informatica, 1986
• The theory of fringe analysis and its application to 23 trees and b-trees
  Information and Control, 1982
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979
• Dynamic hashing
  BIT Numerical Mathematics, 1978