Repeated random insertion into a priority queue

DOI10.1016/0196-6774(85)90028-8zbMath0592.68022OpenAlexW1978276814MaRDI QIDQ3721798

Béla Bollobás, Istvan Simon

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90028-8

zbMATH Keywords

priority queueinsertionheapdata typelinearly ordered set

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Algorithms in computer science (68W99)

Related Items

Divisor generating functions and insertion into a heap ⋮ On the random construction of heaps ⋮ Recurrence relations on heaps ⋮ A path integral approach to data structure evolution ⋮ A Survey on Priority Queues