|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Random insertion into a priority queue structure
Sept. 1975 (vol. 1 no. 3)
pp. 292-298
| ASCII Text | x | ||
| Thomas Porter, "Random insertion into a priority queue structure," IEEE Transactions on Software Engineering, vol. 1, no. 3, pp. 292-298, Sept., 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/TSE.1975.6312854, author = {Thomas Porter}, title = {Random insertion into a priority queue structure}, journal ={IEEE Transactions on Software Engineering}, volume = {1}, number = {3}, issn = {0098-5589}, year = {1975}, pages = {292-298}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.1975.6312854}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Random insertion into a priority queue structure IS - 3 SN - 0098-5589 SP292 EP298 EPD - 292-298 A1 - Thomas Porter, PY - 1975 KW - Binary trees KW - Numerical models KW - Computational modeling KW - Analytical models KW - Data models KW - Educational institutions KW - Probability distribution KW - priority queue KW - Analysis of algorithms KW - heap insertion KW - heap sort VL - 1 JA - IEEE Transactions on Software Engineering ER - | |||
The average number of levels that a new element moves up when inserted into a heap is investigated. Two probabilistic models, under which such an average might be computed are proposed. A "Lemma of Conservation of Ignorance" is formulated and used in the derivation of an exact formula for the average in one of these models. It is shown that this average is bounded by a constant and its asymptotic behavior is discussed. Numerical data for the second model are also provided and analyzed.
Index Terms:
Binary trees,Numerical models,Computational modeling,Analytical models,Data models,Educational institutions,Probability distribution,priority queue,Analysis of algorithms,heap insertion,heap sort
Citation:
Thomas Porter, "Random insertion into a priority queue structure," IEEE Transactions on Software Engineering, vol. 1, no. 3, pp. 292-298, Sept. 1975, doi:10.1109/TSE.1975.6312854
Usage of this product signifies your acceptance of the Terms of Use.