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

DOI10.1016/S0304-3975(97)00037-6MaRDI QIDQ1275072zbMATH OpenOpenAlexFDO

Authors Shmuel Zaks, Mordecai J. Golin

Publication date 12 January 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00037-6

zbMATH Keywords

labelled treestransformation pairs

Mathematics Subject Classification ID

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

Recommendations

• The permutational power of a priority queue
• Priority Queues and Permutations
• Priority queue sorting and labeled trees
• Transforming binary sequences using priority queues

Cites work

• A data structure for dynamic trees
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Labelled trees and factorizations of a cycle into transpositions
• Priority Queues and Permutations
• The permutational power of a priority queue

Cited in

(8)

• Bounded capacity priority queues
• Priority queue sorting and labeled trees
• A five-element transformation monoid on labelled trees
• The permutational power of a priority queue
• scientific article; zbMATH DE number 2127737 (Why is no real title available?)
• Priority Queues and Permutations
• Priority queues with binary priorities
• Labelled trees and pairs of input-output permutations in priority queues

This page was built for publication: Labelled trees and pairs of input--output permutations in priority queues

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