iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/BF01990338
The permutational power of a priority queue | BIT Numerical Mathematics Skip to main content
Log in

The permutational power of a priority queue

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A priority queue transforms an input permutationσ of some set of sizen into an output permutationτ. It is shown that the number of such pairs (σ, τ) is (n + 1)n−1. Some related enumerative and algorithmic questions are also considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D. E. Knuth:Sorting and Searching, The Art of Computer Programming Vol. 3, Addison-Wesley, (Reading, Massachusetts), 1973.

    Google Scholar 

  2. J. Riordan:An Introduction to Combinatorial Analysis, Wiley (New York) 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported by the National Science and Engineering Research Council of Canada under Grant A4219.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Atkinson, M.D., Thiyagarajah, M. The permutational power of a priority queue. BIT 33, 1–6 (1993). https://doi.org/10.1007/BF01990338

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01990338

Keywords

CR Categories

Navigation