Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Order 10 (1993), S. 31-36 
    ISSN: 1572-9273
    Keywords: 06A06 ; Priority queue ; binary sequence ; enumeration
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A priority queue transforms an input sequence σ into an output sequence τ which is a re-ordering of the sequence σ. The setR of all such related pairs is studied in the case that σ is a binary sequence. It is proved thatR is a partial order and that ¦R¦=c n+1, the (n+1)th Catalan number. An efficient (O(n 2)) algorithm is given for computing the number of outputs achievable from a given input.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...