{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:01Z","timestamp":1759335901355},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540510833"},{"type":"electronic","value":"9783540461524"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51083-4_60","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:40:33Z","timestamp":1330202433000},"page":"201-212","source":"Crossref","is-referenced-by-count":13,"title":["Lambda-Upsilon-Omega: An assistant algorithms analyzer"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Salvy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"18_CR1","volume-title":"Asymptotic Methods in Analysis","author":"N. G. Bruijn de","year":"1981","unstructured":"N. G. de Bruijn [1981]. Asymptotic Methods in Analysis. Dover, New York, 1981."},{"key":"18_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-2196-8","volume-title":"Advanced Combinatorics","author":"L. Comtet","year":"1974","unstructured":"L. Comtet [1974]. Advanced Combinatorics. Reidel, Dordrecht, 1974."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"P. Flajolet [1985]. \u201cElements of a general theory of combinatorial structures\u201d, in Proc. FCT Conf., Lecture Notes in Comp. Sc, Springer Verlag, 1985, 112\u2013127.","DOI":"10.1007\/BFb0028797"},{"key":"18_CR4","unstructured":"Ph. Flajolet [1988]. \u201cMathematical Methods in the Analysis of Algorithms and Data Structures,\u201d in Trends in Theoretical Computer Science, E B\u00f6rger Editor, Computer Science Press, 1988."},{"key":"18_CR5","unstructured":"P. Flajolet and A. M. Odlyzko [1987]. \u201cSingularity Analysis of Generating Functions\u201d, preprint, 1987."},{"key":"18_CR6","first-page":"301","volume":"19","author":"P. Flajolet","year":"1987","unstructured":"P. Flajolet and J-M. Steyaert [1987]. \u201cA Complexity Calculus for Recursive Tree Algorihms\u201d, J. of Computer and System Sciences19, 1987, 301\u2013331.","journal-title":"J. of Computer and System Sciences"},{"key":"18_CR7","volume-title":"Combinatorial Enumerations","author":"I. Goulden","year":"1983","unstructured":"I. Goulden and D. Jackson [1983]. Combinatorial Enumerations. Wiley, New York, 1983."},{"key":"18_CR8","unstructured":"D. H. Greene [1983]. \u201cLabelled Formal Languages and Their Uses,\u201d Stanford University, Technical Report STAN-CS-83-982, 1983."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1215\/ijm\/1256054216","volume":"12","author":"B. Harris","year":"1968","unstructured":"B. Harris and L. Schoenfeld [1968]. \u201cAsymptotic Expansions for the Coefficients of Analytic Functions\u201d, Illinois J. Math.12, 1968, 264\u2013277.","journal-title":"Illinois J. Math."},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1515\/crll.1956.196.67","volume":"196","author":"W. K. Hayman","year":"1956","unstructured":"W. K. Hayman [1956]. \u201cA Generalization of Stirling's Formula\u201d, J. Reine und Angewandte Mathematik196, 1956, 67\u201395.","journal-title":"J. Reine und Angewandte Mathematik"},{"key":"18_CR11","volume-title":"Applied and Computational Complex Analysis. Three Volumes","author":"P. Henrici","year":"1977","unstructured":"P. Henrici [1977]. Applied and Computational Complex Analysis. Three Volumes. Wiley, New York, 1977."},{"key":"18_CR12","first-page":"185","volume":"35","author":"T. Hickey","year":"1988","unstructured":"T. Hickey and J. Cohen [1988]. \u201cAutomatic Program Analysis\u201d, J.A.C.M.35, 1988, 185\u2013220","journal-title":"J.A.C.M."},{"key":"18_CR13","volume-title":"The Art of Computer Programming. Volume 1: Fundamental Algorithms","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth [1973a]. The Art of Computer Programming. Volume 1: Fundamental Algorithms. Addison-Wesley, Reading, MA, second edition 1973.","edition":"second edition"},{"key":"18_CR14","volume-title":"The Art of Computer Programming. Volume 3: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth [1973b]. The Art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973."},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","volume":"30","author":"A. Meir","year":"1978","unstructured":"A. Meir and J. W. Moon [1978]. \u201cOn the Altitude of Nodes in Random Trees,\u201d Canadian Journal of Mathematics30, 1978, 997\u20131015.","journal-title":"Canadian Journal of Mathematics"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02546665","volume":"68","author":"G. P\u00f3lya","year":"1937","unstructured":"G. P\u00f3lya [1937]. \u201cKombinatorische Anzahlbestimmungen f\u00fcr Gruppen, Graphen und chemische Verbindungen\u201d, Acta Mathematica68, 1937, 145\u2013254. Translated in: G. P\u00f3lya and R. C. Read, Combinatorial Enumeration of Groups, Graphs and Chemical Compounds, Springer, New-York, 1987.","journal-title":"Acta Mathematica"},{"key":"18_CR17","volume-title":"Verojatnostnie Metody v Kombinatornom Analize","author":"V. N. Sachkov","year":"1978","unstructured":"V. N. Sachkov [1978]. Verojatnostnie Metody v Kombinatornom Analize, Nauka, Moscow, 1978."},{"key":"18_CR18","volume-title":"Algorithms","author":"R. Sedgewick","year":"1983","unstructured":"R. Sedgewick [1983]. Algorithms. Addison-Wesley, Reading, 1983."},{"key":"18_CR19","unstructured":"R. P. Stanley [1978]. \u201cGenerating Functions,\u201d in Studies in Combinatorics, edited by G-C. Rota, M. A. A. Monographs, 1978."},{"key":"18_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"R. P. Stanley","year":"1986","unstructured":"R. P. Stanley [1986]. Enumerative Combinatorics, Wadsworth and Brooks\/Cole, Monterey, 1986."},{"key":"18_CR21","unstructured":"J-M. Steyaert [1984]. \u201cComplexit\u00e9 et Structure des Algorithmes\u201d, These de Doctorat \u00e8s-Sciences, Universit\u00e9 Paris 7, 1984."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51083-4_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T17:56:04Z","timestamp":1687283764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51083-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510833","9783540461524"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-51083-4_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}