{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:02Z","timestamp":1725663302394},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_17","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:06:05Z","timestamp":1330203965000},"page":"192-205","source":"Crossref","is-referenced-by-count":0,"title":["Discs and other related data structures"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Luccio","sequence":"first","affiliation":[]},{"given":"Mireille","family":"R\u00e9gnier","sequence":"additional","affiliation":[]},{"given":"Ren\u00e9","family":"Schott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"\u201dA Diffusion Limit for a Class of Randomly-Growing Binary Trees\u201d in Probability Theory and Related Fields 79, 4 (1988) 509\u2013542.","DOI":"10.1007\/BF00318784"},{"key":"17_CR2","first-page":"145","volume":"25","author":"\u201dAlgebraic Methods for Trie Statistics","year":"1985","unstructured":"\u201dAlgebraic Methods for Trie Statistics\u201d in Annals of Discrete Mathematics 25 (1985) 145\u2013188.","journal-title":"Annals of Discrete Mathematics"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"\u201dSome Uses of the Mellin Transform Techniques in the Analysis of Algorithms\u201d in Combinatorial Algorithms on Words, Springer NATO ASI SEr. F12, (1985) 241\u2013254.","DOI":"10.1007\/978-3-642-82456-2_16"},{"key":"17_CR4","unstructured":"\u201dTrie Partitioning Process:Limiting Distributions\u201d in Proc. CAAP'86, Lecture Notes in Computer Science 214 (1986) 194\u2013210."},{"key":"17_CR5","unstructured":"\u201dNormal Limiting Distribution of the Size of Tries\u201d in Proc.Performance '87, North-Holland, P.-J. Courtois and G. Latouche Ed., (1987) 209\u2013223."},{"key":"17_CR6","unstructured":"The Art of Computer Programming. Vol 3:Sorting and Searching, Addison-Wesley,Reading,Mass.,(1973)"},{"key":"17_CR7","unstructured":"\u201dOn the Balance Property of Patricia Tries: External Path Length Viewpoint\u201d to appear in TCS, (1989)."},{"key":"17_CR8","unstructured":"\u201dDISCS trees: a new data structure for DIgital Search by ComparisonS\u201d in Dept. Inf. Syst. Comp. Sci., Nat. Univ. of Singapore, Res. Report TR11\/86, (1986)."},{"key":"17_CR9","unstructured":"\u201dAlgorithms\u201d Addison-Wesley, Reading, Mass.,(1983)."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:52Z","timestamp":1605648112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}