The Maximum Size of Dynamic Data Structures
- 1 October 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (5) , 807-823
- https://doi.org/10.1137/0220050
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- General methods for the analysis of the maximum size of dynamic data structuresPublished by Springer Nature ,1989
- A Queueing Analysis of Hashing with Lazy DeletionSIAM Journal on Computing, 1987
- The complexity of hashing with lazy deletionAlgorithmica, 1986
- Space-economical plane-sweep algorithmsComputer Vision, Graphics, and Image Processing, 1986
- Sequence of operations analysis for dynamic data structuresJournal of Algorithms, 1980
- Computing integrated costs of sequences of operations with application to dictionariesPublished by Association for Computing Machinery (ACM) ,1979
- The differential equations of birth-and-death processes, and the Stieltjes moment problemTransactions of the American Mathematical Society, 1957