{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:09:41Z","timestamp":1725458981455},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540188347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0035833","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:40:10Z","timestamp":1138203610000},"page":"73-80","source":"Crossref","is-referenced-by-count":1,"title":["Functional equations for data structures"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bergeron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Labelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Leroux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","first-page":"201","volume":"12","author":"M. Bajraktarevic","year":"1957","unstructured":"M. Bajraktarevic: Sur une \u00e9quation fonctionnelle, Glasnik Mat.-Fiz. I Astr. 12, 1957, pp 201\u2013205.","journal-title":"Glasnik Mat.-Fiz. I Astr."},{"issue":"4","key":"8_CR2","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1145\/322092.322099","volume":"25","author":"R.P. Brent","year":"1978","unstructured":"R.P. Brent and H.T. Kung; Fast Algorithms for Manipulating Formal Power Series, JACM 25 (4), 1978, pp 581\u2013595.","journal-title":"JACM"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0196-8858(82)80013-4","volume":"3","author":"H. D\u00e9coste","year":"1982","unstructured":"H. D\u00e9coste, G. Labelle, and P. Leroux; Une approche combinatoire pour l'it\u00e9ration de Newton-Raphson, Adv. in Appl. Math. 3, Acad. Press, 1982, pp 407\u2013416.","journal-title":"Adv. in Appl. Math."},{"issue":"2","key":"8_CR4","first-page":"151","volume":"9","author":"S. Dubuc","year":"1985","unstructured":"S. Dubuc; Une \u00e9quation fonctionnelle pour diverses constructions g\u00e9om\u00e9triques, Annales des Sciences math\u00e9matiques du Qu\u00e9bec, Vol. 9, No.2, 1985, pp 151\u2013174.","journal-title":"Annales des Sciences math\u00e9matiques du Qu\u00e9bec"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0028797","volume":"199","author":"P. Flajolet","year":"1985","unstructured":"P. Flajolet; Elements of a General Theory of Combinatorial Structures, Proceedings FCT85,L. Budach, Ed., Lect. Notes in Comp. Science, Springer-Verlag, Vol. 199 (1985), pp. 112\u2013127.","journal-title":"Proceedings FCT85,L. Budach, Ed., Lect. Notes in Comp. Science, Springer-Verlag"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(77)90034-2","volume":"4","author":"J. Fran\u00e7on","year":"1977","unstructured":"J. Fran\u00e7on: On the Analysis of Algorithms for Trees, Theor. Comp. Science, Vol 4, 1977, pp 155\u2013169.","journal-title":"Theor. Comp. Science"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1051\/ita\/1984180403551","volume":"18","author":"J. Fran\u00e7on","year":"1984","unstructured":"J. Fran\u00e7on; Sur le nombre de registres n\u00e9cessaires \u00e0 l'\u00e9valuation d'une expression arithm\u00e9tique, RAIRO, Informatique th\u00e9orique, 18 (1984), pp. 355\u2013364.","journal-title":"RAIRO, Informatique th\u00e9orique"},{"key":"8_CR8","unstructured":"G.H. Gonnet; Handbook of Algorithms and Data Structures, International Computer Science Series, Addison-Wesley, 1984."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0001-8708(81)90052-9","volume":"42","author":"A. Joyal","year":"1981","unstructured":"A. Joyal; Une th\u00e9orie combinatoire des s\u00e9ries formelles, Adv. in Math. 42, 1981, pp 1\u201382.","journal-title":"Adv. in Math."},{"key":"8_CR10","unstructured":"D. Knuth; The Art of Computer Programming, vol.2, Addison-Wesley, 1981."},{"key":"8_CR11","unstructured":"G. Labelle; Some New Computational Methods in the Theory of Species, in Combinatoire \u00e9num\u00e9rative, Proceedings, Montr\u00e9al, Qu\u00e9bec 1985, ed. G.Labelle and P.Leroux, Springer Lecture Notes in Math., No.1234, 1986, pp. 192\u2013209."},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0097-3165(85)90097-4","volume":"40","author":"G. Labelle","year":"1985","unstructured":"G. Labelle; Une combinatoire sous-jacente au th\u00e9or\u00e8me des fonctions implicites, J. Compin. Theory, Series A, 40, 1985, pp 377\u2013393","journal-title":"J. Compin. Theory"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"P. Leroux and G. Viennot; Combinatorial Resolution of Systems of Differential Equations I, Ordinary Differential Equations, in Combinatoire \u00e9num\u00e9rative, Proceedings, Montr\u00e9al, Qu\u00e9bec 1985, ed. G.Labelle and P.Leroux, Springer Lecture Notes in Math., No.1234, 1986.","DOI":"10.1007\/BFb0072518"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn; Data Structures and Algorithms, I: Sorting and Searching, Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-69672-5_2"},{"issue":"3","key":"8_CR15","first-page":"248","volume":"23","author":"T. Ottmann","year":"1980","unstructured":"T. Ottmann and D. Wood; 1-2 Brother Trees or AVL Trees Revisited, Comp. Jour., Vol 23 (3), 1980, pp 248\u2013255.","journal-title":"Comp. Jour."},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/0001-8708(82)90005-6","volume":"44","author":"A. Odlyzcko","year":"1982","unstructured":"A. Odlyzcko; Periodic Oscillations of coefficients of Power Series that satisfiy Functional equations, Adv. in Math., 44 (1982),pp. 180\u2013205.","journal-title":"Adv. in Math."},{"key":"8_CR17","first-page":"336","volume":"A 63","author":"A.H. Read","year":"1951","unstructured":"A.H. Read. The Solution of a Functional Equation, Proc. Royal Soc. Edinburgh, A 63, 1951\u20131952, pp 336\u2013345.","journal-title":"Proc. Royal Soc. Edinburgh"},{"issue":"4","key":"8_CR18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"J. Vuillemin; A Unifying Look at Data Structures, Comm. of ACM, Vol 23 (4), 1980, pp 229\u2013239.","journal-title":"Comm. of ACM"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A.C-C. Yao","year":"1978","unstructured":"A.C-C. Yao; On Random 2\u20133 Trees, Acta Informatica, Vol. 9, 1978, pp 159\u2013170.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","STACS 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035833.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:15:22Z","timestamp":1607552122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540188347"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0035833","relation":{},"subject":[]}}