{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:09:47Z","timestamp":1725458987753},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540188347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0035863","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:40:10Z","timestamp":1138203610000},"page":"393-394","source":"Crossref","is-referenced-by-count":5,"title":["Darwin: Computer algebra and enumerative combinatorics"],"prefix":"10.1007","author":[{"given":"F.","family":"Bergeron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Cartier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"F.Bergeron, G.Labelle, and P.Leroux; Functional Equation for Data Structures, this volume."},{"issue":"4","key":"38_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":"38_CR3","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":"Lect. Notes in Comp. Science"},{"key":"38_CR4","unstructured":"G.H. Gonnet; Handbook of Algorithms and Data Structures, International Computer Science Series, Addison-Wesley, 1984."},{"key":"38_CR5","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":"38_CR6","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. Combin. Theory, Series A, 40, 1985, pp 377\u2013393","journal-title":"J. Combin. Theory"},{"issue":"4","key":"38_CR7","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"}],"container-title":["Lecture Notes in Computer Science","STACS 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035863.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:15:55Z","timestamp":1607552155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540188347"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0035863","relation":{},"subject":[]}}