Analysis of some parameters for random nodes in priority trees

MaRDI QIDQ5387737zbMATH OpenFDO

Authors Alois Panholzer

Publication date 27 May 2008

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/546/0.html

zbMATH Keywords

limiting distributionspriority queue administrationpriority treesrandom node

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Probability distributions: general theory (60E05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Average-case analysis of priority trees: A structure of priority queue administration
• Analysis of insertion costs in priority trees
• scientific article; zbMATH DE number 2159651
• On Some Parameters in Heap Ordered Trees
• The properties of random trees

Cited in

(3)

• Average-case analysis of priority trees: A structure of priority queue administration
• Asymptotic analysis of Hoppe trees
• Analysis of insertion costs in priority trees

This page was built for publication: Analysis of some parameters for random nodes in priority trees

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