{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:35Z","timestamp":1725663695518},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512950"},{"type":"electronic","value":"9783540461869"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51295-0_126","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:52:30Z","timestamp":1330203150000},"page":"171-186","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A language for the p-ary trees"],"prefix":"10.1007","author":[{"given":"Gerard","family":"LEVY","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","volume":"18","author":"P. Larson","year":"1978","unstructured":"LARSON Per-Ake, \"Dynamyc hashing\", BIT 18 (1978), 184\u2013201.","journal-title":"BIT"},{"key":"12_CR2","unstructured":"LITWIN Witold. \"Virtual hashing, a dynamically changing hashing\", 4 th. Int. Conf on VLDB, Berlin (sept 1978), 517\u201323."},{"issue":"3","key":"12_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"FAGIN R., NIEVERGELT J., PIPPENGER N., STRONG H.R., \"Extensible hashing \u2014 a fast access method for dynamic files\", ACM-TODS, 4, 3, (sept. 1979), 315\u2013344.","journal-title":"ACM-TODS"},{"key":"12_CR4","unstructured":"KOUAKOU Jean. These de Troisieme Cycle, Universite de Paris IX \u2014 1986."},{"key":"12_CR5","unstructured":"REGNIER Mireille, Th\u00e8se de Troisi\u00e8me Cycle, Universit\u00e9 de Paris XI, 1983."},{"key":"12_CR6","first-page":"145","volume":"25","author":"P. Flajolet","year":"1985","unstructured":"FLAJOLET P., REGNIER M., SOTTEAU D., \"Algebraic methods for tries statistics\", Ann. Discrete Math. 25 (1985), 145\u2013188.","journal-title":"Ann. Discrete Math."},{"key":"12_CR7","unstructured":"LITWIN W., ZEGOUR D., LEVY G., \"Multilevel trie hashing\", EDBT 88., Venice."},{"key":"12_CR8","unstructured":"ZEGOUR Djamal Eddine, Th\u00e8se Universit\u00e9 de Paris-Dauphine, 1988."},{"key":"12_CR9","unstructured":"LEVY G\u00e9rard, \"Analyse des performances du p-hachage dynamique virtuel\", Revue Mod\u00e8les et Bases de Donn\u00e9es (M.D.B.), No 6, 15\u201324."},{"key":"12_CR10","unstructured":"Encyclopedia of Mathematics and its applications, Vol 17, Combinatorics and words, M. LOTHAIRE, Chap. 11: \"words and tress\", 1983, Addison-Wesley."},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/359423.359434","volume":"20","author":"G. D. Knott","year":"1977","unstructured":"KNOTT Gary D., \"A numbering system for binary trees\", Comm. ACM,20 (1977), 113\u2013115.","journal-title":"Comm. ACM"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/0206055","volume":"6","author":"F. Ruskey","year":"1977","unstructured":"RUSKEY F., HU T.C., \"generating binary trees lexicographically\", SIAM J. COMP. 6 (1977), 745\u2013758.","journal-title":"SIAM J. COMP."},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/0207034","volume":"7","author":"F. Ruskey","year":"1978","unstructured":"RUSKEY F., \"Generating t-ary trees lexicographically\", SIAM J. COMP. 7 (1978), 706\u2013712.","journal-title":"SIAM J. COMP."},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/322077.322082","volume":"25","author":"D. Rotem","year":"1978","unstructured":"ROTEM DORON, VAROL Y.L., \"Generation of binary trees from ballot sequences\", JACM 25 (1978), 396\u2013404.","journal-title":"JACM"},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0208006","volume":"8","author":"S. Zacks","year":"1979","unstructured":"ZACKS S., RICHARDS D., \"generating trees and other combinatorial objects lexicographically\", SIAM J. COMP. 8 (1979), 73\u201381.","journal-title":"SIAM J. COMP."},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S. Zacks","year":"1980","unstructured":"ZACKS S., \"Lexicographically generation of ordered trees\", Theoret. Comput.Sci. 10 (1980), 63\u201382.","journal-title":"Theoret. Comput.Sci."},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322169.322170","volume":"27","author":"A. Proskurowski","year":"1980","unstructured":"PROSKUROWSKI A., \"On generation of binary trees\", JACM 27 (1980), 1\u20132.","journal-title":"JACM"},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/322169.322171","volume":"27","author":"M. Solomon","year":"1980","unstructured":"SOLOMON M., FINKEL R.A., \"A note on enumerating binary trees\", JACM 27 (1980), 3\u20135.","journal-title":"JACM"},{"key":"12_CR19","unstructured":"LEVY G., LITWIN W., WANG Hong, \"on generating binary and t-ary trees lexicographically\", Note interne INRIA (1988)."},{"key":"12_CR20","unstructured":"LEVY Gerard, \"Arbres homogenes et mots associes\", Cahiers du centre de recherche IP9, Universit\u00e9 de Paris-Dauphine (1985)."},{"key":"12_CR21","unstructured":"LEVY G\u00e9rard, \"Etude de la complexit\u00e9 moyenne de deux algorithmes de reconnaissance des mots des arbres p-aires\", to appear."}],"container-title":["Lecture Notes in Computer Science","Foundations of Data Organization and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51295-0_126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:52:31Z","timestamp":1578527551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51295-0_126"}},"subtitle":["Application to the dynamic virtual hashing methods"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512950","9783540461869"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-51295-0_126","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}