Library

feed icon rss

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
    BIT 15 (1975), S. 409-422 
    ISSN: 1572-9125
    Keywords: algorithm analysis ; binary trees ; priority queues ; event scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A special kind of priority queue structure, priority trees (p-trees), and an algorithm for building such trees are investigated. The main part of the paper is devoted to a mathematical analysis of the algorithm showing that the expected number of key comparisons to insert a “random” element into a “random”p-tree withn nodes isO((logn)2). Also some practical experiments, comparing different types of priority queue strategies, are presented.
    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...