The permutational power of a priority queue
From MaRDI portal
Publication:2366646
DOI10.1007/BF01990338zbMath0771.68041OpenAlexW2005212141MaRDI QIDQ2366646
Publication date: 23 August 1993
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01990338
Related Items
Permuted composition tableaux, 0-Hecke algebra and labeled binary trees, Bounded capacity priority queues, Labelled trees and pairs of input-output permutations in priority queues, Unnamed Item, Priority queues with binary priorities, Labelled trees and pairs of input--output permutations in priority queues, Parking functions, valet functions and priority queues, Transforming binary sequences using priority queues, Permuting machines and priority queues
Cites Work