✦ LIBER ✦

Rank-Pairing Heaps

✍ Scribed by Haeupler, Bernhard; Sen, Siddhartha; Tarjan, Robert E.

Book ID: 118161906
Publisher: Society for Industrial and Applied Mathematics
Year: 2011
Tongue: English
Weight: 530 KB
Volume: 40
Category: Article
ISSN: 0097-5397
DOI: 10.1137/100785351

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On rank functions for heaps

✍ R.M. Green 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 176 KB

The pairing heap: A new form of self-adj

The pairing heap: A new form of self-adjusting heap

✍ Michael L. Fredman; Robert Sedgewick; Daniel D. Sleator; Robert E. Tarjan 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 783 KB

Heaps on Heaps

✍ Gonnet, Gaston H.; Munro, J. Ian 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 781 KB

Pair Rank Set Sampling

✍ Hassen A. Muttlak 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB 👁 1 views

The bounds of min-max pair heap construc

The bounds of min-max pair heap construction

✍ R.A. Chowdhury; M.Z. Rahman; M. Kaykobad 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Small-Rank Selection in Parallel, with A

Small-Rank Selection in Parallel, with Applications to Heap Construction

✍ Paul F Dietz; Rajeev Raman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 115 KB

We study the parallel complexity of selecting the kth smallest of n elements Ž on the CRCW PRAM. We show that this problem can be solved in O log log n q . Ž. log krlog log n time and O n operations for all 1 F k F nr2, which is superior to existing deterministic bounds when k is small compared to n