Author:
Kenyon Claire M.,Vitter Jeffrey Scott
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference14 articles.
1. R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong. Extendible Hashing—A Fast Access Method for Dynamic Files,ACM Transactions on Database Systems,4(3) (September 1979), 315–344.
2. P. Flajolet. Analyse d'algorithmes de manipulation d'arbres et de fichiers,Cahiers du Bureau Universitaire de Recherche Operationnelle,34–35 (1981), 1–209.
3. P. Flajolet, J. Françon, and J. Vuillemin. Sequence of Operations Analysis for Dynamic Data Structures,Journal of Algorithms,1(2) (June 1980), 111–141.
4. G. H. Gonnet. Expected Length of the Longest Probe Sequence in Hash Code Searching,Journal of the ACM,28(2) (April 1981), 289–304.
5. S. Karlin and J. M. McGregor. Linear Growth Birth and Death Processes,Journal of Mathematics and Mechanics, 7(4) (1958).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献