A branching process arising in dynamic hashing, trie searching and polynomial factorization

This publication has 6 references indexed in Scilit:

• Expected Length of the Longest Probe Sequence in Hash Code Searching
  Journal of the ACM, 1981
• A new algorithm for factoring polynomials over finite fields
  Mathematics of Computation, 1981
• A note on the analysis of extendible hashing
  Information Processing Letters, 1980
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979
• Dynamic hashing
  BIT Numerical Mathematics, 1978
• Combinatorial Chance.
  Economica, 1962