https://scholars.lib.ntu.edu.tw/handle/123456789/117243
標題: | Internal path length of the binary representation of heap-ordered trees | 作者: | WEN-CHIN CHEN Ni, Wen-Chun |
關鍵字: | Algorithms; Combinatorial enumeration; Data structures; Generating functions; Heap-ordered trees; Internal path length; Probability | 公開日期: | 1994 | 卷: | 51 | 期: | 3 | 起(迄)頁: | 129-132 | 來源出版物: | Information Processing Letters | 摘要: | We show that the average internal path length of the binary representation of a random n-node heap-ordered tree is asymptotically n πn-2n + O( n). © 1994. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/154493 https://www.scopus.com/inward/record.uri?eid=2-s2.0-0028485196&doi=10.1016%2f0020-0190%2894%2900081-6&partnerID=40&md5=0256f1b63352fd5cab7416384adcb151 |
ISSN: | 00200190 | DOI: | 10.1016/0020-0190(94)00081-6 | SDG/關鍵字: | Algorithms; Combinatorial mathematics; Computer applications; Computer systems; Data structures; Numerical methods; Probability; Queueing theory; Random number generation; Random processes; Trees (mathematics); Combinatorial enumeration; Generating function; Heap ordered trees; Internal path length; Binary sequences |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。