The Maximum Size of Dynamic Data Structures
Copyright policy )The Maximum Size of Dynamic Data Structures
Summary: The maximum size of data structure attained over a sequence of insertions, (lazy) deletions, and queries is studied. Two underlying models are used: probabilistic and combinatorial. Several open problems are solved by extending asymptotic methods from the theory of analysis of algorithms. This yields tight asymptotic estimates of expected maximum size for both continuous and discrete probability assumptions. Applications in queueing theory and space-economical algorithms (in computational geometry) are mentioned.
- University of Kansas Libraries United States
- Brown University United States
Lists, Data structures, Analysis of algorithms and problem complexity, Occupancy distribution, Sweepline, priority queues, queueing theory, Computational geometry, hashing, Hashing, Priority queues, Markov process, lazy deletions, sweepline, File histories, Lazy deletion, dictionaries, occupancy distribution, 004, VLSI, Queueing theory, Maximum, Symbol tables, Dictionaries, file histories, Algorithm analysis, symbol tables, lists
Lists, Data structures, Analysis of algorithms and problem complexity, Occupancy distribution, Sweepline, priority queues, queueing theory, Computational geometry, hashing, Hashing, Priority queues, Markov process, lazy deletions, sweepline, File histories, Lazy deletion, dictionaries, occupancy distribution, 004, VLSI, Queueing theory, Maximum, Symbol tables, Dictionaries, file histories, Algorithm analysis, symbol tables, lists
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!