An Introduction to Renewal Theory with Applications to Random Tries
碩士 === 國立交通大學 === 應用數學系所 === 103 === The trie is a data structure of fundamental importance in Computer Science. This is reflected by the fact that tries have found numerous applications, such as in searching, sorting, contention tree algorithms, retrieving IP addresses and satellite data, internet...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/28706654855522368506 |