Priority Queues and Permutations

DOI10.1137/S0097539792240893MaRDI QIDQ4327419zbMATH OpenOpenAlexFDO

Authors Robert Beals, Michael D. Atkinson

Publication date 6 April 1995

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792240893

zbMATH Keywords

permutationenumerationpriority queue

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Data structures (68P05)

Recommendations

• The permutational power of a priority queue
• Transforming binary sequences using priority queues
• Priority queues with binary priorities
• Labelled trees and pairs of input--output permutations in priority queues
• Priority queues and multisets

Cited in

(15)

• Equivalence between priority queues and sorting
• Priority queue sorting and labeled trees
• Labelled trees and pairs of input--output permutations in priority queues
• Pattern classes and priority queues
• Parking functions, valet functions and priority queues
• Transforming binary sequences using priority queues
• Labelled trees and pairs of input-output permutations in priority queues
• Queue-mergesort
• Bounded capacity priority queues
• Priority queues and multisets
• Sorting by shuffling methods and a queue
• Priority queues with binary priorities
• Priority queueing involving orientation and the problems of their software implementation
• Rank order filters and priority queues
• Permuting machines and priority queues

This page was built for publication: Priority Queues and Permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327419)