Priority queue sorting and labeled trees

DOI10.1007/S000260300004MaRDI QIDQ1400803zbMATH OpenOpenAlexFDO

Authors Angèle. M. Hamel

Publication date 14 August 2003

Published in Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

allowable pairslabeled treespriority queue

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• Labelled trees and pairs of input--output permutations in priority queues
• Bounded capacity priority queues
• Priority Queues and Permutations
• The permutational power of a priority queue
• Transforming binary sequences using priority queues

Cited in

(9)

• Rank order filters and priority queues
• Labelled trees and pairs of input--output permutations in priority queues
• Permuted composition tableaux, 0-Hecke algebra and labeled binary trees
• Priority Range Trees
• Tree traversals and permutations
• Equivalence between priority queues and sorting
• Pattern classes and priority queues
• The structure of alternative tableaux
• Labelled trees and pairs of input-output permutations in priority queues

This page was built for publication: Priority queue sorting and labeled trees

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