scientific article

zbMath0651.68037MaRDI QIDQ3796732

Patricio V. Poblete, J. Ian Munro, Svante Carlsson

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

priority queueimplicit data structurebinomial queue

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (20)

Sorting multisets stably in minimum space ⋮ Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time ⋮ Regular numeral systems for data structures ⋮ The randomized complexity of maintaining the minimum ⋮ Worst-case efficient external-memory priority queues ⋮ Fast meldable priority queues ⋮ The K-D heap: An efficient multi-dimensional priority queue ⋮ Integer representation and counting in the bit probe model ⋮ An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop ⋮ Optimizing binary heaps ⋮ Colored range queries and document retrieval ⋮ Space-efficient data-analysis queries on grids ⋮ A pointer-free data structure for merging heaps and min-max heaps ⋮ A generalization of binomial queues ⋮ Two skew-binary numeral systems and one application ⋮ Priority Queues and Sorting for Read-Only Data ⋮ Sorting multisets stably in minimum space ⋮ Computing (and Life) Is All about Tradeoffs ⋮ A Survey on Priority Queues ⋮ Weak-heap sort

This page was built for publication: