Average-Case Analysis of Algorithms and Data Structures

This publication has 63 references indexed in Scilit:

• Linear probing: The probable largest search time grows logarithmically with the number of records
  Journal of Algorithms, 1987
• A complexity calculus for recursive tree algorithms
  Theory of Computing Systems, 1986
• A note on the height of binary search trees
  Journal of the ACM, 1986
• Improved upper bounds on shellsort
  Journal of Computer and System Sciences, 1985
• Analysis of grid file algorithms
  BIT Numerical Mathematics, 1985
• Periodic oscillations of coefficients of power series that satisfy functional equations
  Advances in Mathematics, 1982
• An analysis of (h, k, 1)-Shellsort
  Journal of Algorithms, 1980
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979
• Linear expected time of a simple union-find algorithm
  Information Processing Letters, 1976
• A Generalisation of Stirling's Formula.
  Journal für die reine und angewandte Mathematik (Crelles Journal), 1956