| dc.contributor | 應數系 | |
| dc.creator (作者) | 符麥克 | |
| dc.creator (作者) | Fuchs, Michael;Yu, Tsan-Cheng | |
| dc.date (日期) | 2023-08 | |
| dc.date.accessioned | 13-Dec-2023 14:16:22 (UTC+8) | - |
| dc.date.available | 13-Dec-2023 14:16:22 (UTC+8) | - |
| dc.date.issued (上傳時間) | 13-Dec-2023 14:16:22 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/148722 | - |
| dc.description.abstract (摘要) | Graph tries are a new and interesting data structure proposed by Jacquet in 2014. They generalize the classical trie data structure which has found many applications in computer science and is one of the most popular data structure on words. For his generalization, Jacquet considered the size (or space requirement) and derived an asymptotic expansion for the mean and the variance when graph tries are built from n independently chosen random labelings of a rooted M-ary tree. Moreover, he conjectured a central limit theorem for the (suitably normalized) size as the number of labelings tends to infinity. In this paper, we verify this conjecture with the method of moments. | |
| dc.format.extent | 105 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Theoretical Computer Science, Vol.968, 114011 | |
| dc.subject (關鍵詞) | Tries; Graph tries; Space requirement; Central limit theorem; Method of moments | |
| dc.title (題名) | Asymptotic normality for the size of graph tries built from M-ary tree labelings | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1016/j.tcs.2023.114011 | |
| dc.doi.uri (DOI) | https://doi.org/10.1016/j.tcs.2023.114011 | |
