The permutational power of a priority queue

DOI10.1007/BF01990338MaRDI QIDQ2366646zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 23 August 1993

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01990338

zbMATH Keywords

permutationenumerationpriority queue

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Data structures (68P05)

Recommendations

• Priority Queues and Permutations
• Labelled trees and pairs of input--output permutations in priority queues
• Transforming binary sequences using priority queues

Cited in

(14)

• Equivalence between priority queues and sorting
• Priority queue sorting and labeled trees
• Labelled trees and pairs of input--output permutations in priority queues
• Permuted composition tableaux, 0-Hecke algebra and labeled binary trees
• Pattern classes and priority queues
• Parking functions, valet functions and priority queues
• Transforming binary sequences using priority queues
• scientific article; zbMATH DE number 7640030 (Why is no real title available?)
• Labelled trees and pairs of input-output permutations in priority queues
• Bounded capacity priority queues
• Priority queues with binary priorities
• Permuting machines and priority queues
• scientific article; zbMATH DE number 3772962 (Why is no real title available?)
• Preimages under the Queuesort algorithm

This page was built for publication: The permutational power of a priority queue

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