General methods for the analysis of the maximum size of dynamic data structures

This publication has 7 references indexed in Scilit:

• A Queueing Analysis of Hashing with Lazy Deletion
  SIAM Journal on Computing, 1987
• The complexity of hashing with lazy deletion
  Algorithmica, 1986
• Space-economical plane-sweep algorithms
  Computer Vision, Graphics, and Image Processing, 1986
• Space Efficient Algorithms for VLSI Artwork Analysis
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Sequence of operations analysis for dynamic data structures
  Journal of Algorithms, 1980
• Computing integrated costs of sequences of operations with application to dictionaries
  Published by Association for Computing Machinery (ACM) ,1979
• The differential equations of birth-and-death processes, and the Stieltjes moment problem
  Transactions of the American Mathematical Society, 1957