✦ LIBER ✦

On implicit data structures for priority queues

✍ Scribed by A. Perko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On RAM Priority Queues

✍ Thorup, Mikkel 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 265 KB

Worst-case data structures for the prior

✍ Rajamani Sundar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Average-Case Analysis of Priority Trees:

✍ A. Panholzer; H. Prodinger 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 315 KB

Implicit data structures for linear hash

✍ Mohamed Ouksel; Peter Scheuermann 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 522 KB

Implicit data structures for fast search

✍ J.Ian Munro; Hendra Suwanda 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 883 KB

A two-queue, one-server model with prior

✍ J. W. Cohen 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 732 KB