Analysis of n-trees

This publication has 10 references indexed in Scilit:

• On the average-case complexity of “bucketing” algorithms
  Journal of Algorithms, 1982
• Order preserving extendible hashing and bucket tries
  BIT Numerical Mathematics, 1981
• Searching and sorting real numbers
  Journal of Algorithms, 1981
• Average time behavior of distributive sorting algorithms
  Computing, 1981
• Optimal Expected-Time Algorithms for Closest Point Problems
  ACM Transactions on Mathematical Software, 1980
• The design and analysis of a new hybrid sorting algorithm
  Information Processing Letters, 1980
• A linear time exact hidden surface algorithm
  ACM SIGGRAPH Computer Graphics, 1980
• Storing a sparse table
  Communications of the ACM, 1979
• The practical significance of D.P. sort revisited
  Information Processing Letters, 1979
• Sorting by distributive partitioning
  Information Processing Letters, 1978