✦ LIBER ✦

Priority Queues and Permutations

✍ Scribed by Atkinson, M. D.; Beals, Robert

Book ID: 118177332
Publisher: Society for Industrial and Applied Mathematics
Year: 1994
Tongue: English
Weight: 718 KB
Volume: 23
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539792240893

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Permuting machines and priority queues

✍ R.E.L. Aldred; M.D. Atkinson; H.P. van Ditmarsch; C.C. Handley; D.A. Holton; D.J 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 202 KB

The permutational power of a priority qu

The permutational power of a priority queue

✍ M. D. Atkinson; Murali Thiyagarajah 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 298 KB

Labelled trees and pairs of input-output

Labelled trees and pairs of input-output permutations in priority queues

✍ M. Golin; S. Zaks 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 912 KB

A sequence of priority queue operations can transform a permutation 72 of n elements to some, but not necessarily all, permutations 6. A recent result of Atkinson and Thiyagarajah (1993) states that the number of distinct transformation pairs (TC., a) is (n + l)"-'. By Cayley's theorem this is also

Priority Queues

✍ Lajos Takács 📂 Article 📅 1964 🏛 INFORMS 🌐 English ⚖ 374 KB

Ordered priority queues

✍ Shou-Hsuan Stephen Huang 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 393 KB

Parallel priority queues

✍ Maria Cristina Pinotti; Geppino Pucci 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 475 KB

This paper introduces the Parallel Priority Queue (PPQ) abstract data t:ype. A PPQ stores a set of integer-valued items and provides operations such as insertion of n new items or deletion of the n smallest ones. Algorithms for realizing PPQ operations on an n-proc~or CREW-PPdL.M are based, on two n