{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:21Z","timestamp":1725663621114},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572732"},{"type":"electronic","value":"9783540480327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57273-2_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:36:46Z","timestamp":1330259806000},"page":"169-180","source":"Crossref","is-referenced-by-count":2,"title":["A calculus of random generation"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Paul","family":"Zimmermann","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Cutsem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., and Odlyzko, A. M. Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics 3, 2 (1990), 216\u2013240.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"15_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(91)90145-R","volume":"79","author":"P. Flajolet","year":"1991","unstructured":"Flajolet, P., Salvy, B., and Zimmermann, P. Automatic average-case analysis of algorithms. Theoretical Computer Science, Series A 79, 1 (Feb. 1991), 37\u2013109.","journal-title":"Theoretical Computer Science, Series A"},{"key":"15_CR3","unstructured":"Flajolet, P., Zimmerman, P., and Van Cutsem, B. A calculus for the random generation of labelled combinatorial structures. Research Report 1830, Institut National de Recherche en Informatique et en Automatique, Jan. 1993. 29 pages. Accepted for publication in Theoretical Computer Science."},{"key":"15_CR4","unstructured":"Greene, D. H. Labelled formal languages and their uses. PhD thesis, Stanford University, June 1983. Available as Report No. STAN-CS-83-982."},{"key":"15_CR5","volume-title":"Mathematics for the analysis of algorithms","author":"D. H. Greene","year":"1981","unstructured":"Greene, D. H., And Knuth, D. E.Mathematics for the analysis of algorithms. Birkhauser, Boston, 1981."},{"issue":"4","key":"15_CR6","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0212044","volume":"12","author":"T. Hickey","year":"1983","unstructured":"Hickey, T., And Cohen, J. Uniform random generation of strings in a contextfree language. SIAM Journal on Computing 12, 4 (1983), 645\u2013655.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"15_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0001-8708(81)90052-9","volume":"42","author":"A. Joyal","year":"1981","unstructured":"Joyal, A. Une th\u00e9orie combinatoire des s\u00e9ries formelles. Advances in Mathematics 42, 1 (1981), 1\u201382.","journal-title":"Advances in Mathematics"},{"key":"15_CR8","first-page":"19","volume-title":"Information Processing 71","author":"D. E. Knuth","year":"1972","unstructured":"Knuth, D. E. Mathematical analysis of algorithms. In Information Processing 71 (1972), North Holland Publishing Company, pp. 19\u201327. Proceedings of IFIP Congress, Ljubljana, 1971."},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","volume":"30","author":"A. Meir","year":"1978","unstructured":"Meir, A., And Moon, J. W. On the altitude of nodes in random trees. Canadian Journal of Mathematics 30 (1978), 997\u20131015.","journal-title":"Canadian Journal of Mathematics"},{"key":"15_CR10","unstructured":"Nijenhus, A., And Wilf, H. S. Combinatorial Algorithms, second ed. Academic Press, 1978."},{"key":"15_CR11","volume-title":"No. 55 in CBMS-NSF Regional Conference Series","author":"H. S. Wilf","year":"1989","unstructured":"Wilf, H. S.Combinatorial Algorithms: An Update. No. 55 in CBMS-NSF Regional Conference Series. Society for Industrial and Applied Mathematics, Philadelphia, 1989."}],"container-title":["Lecture Notes in Computer Science","Algorithms\u2014ESA '93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57273-2_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:02:26Z","timestamp":1619571746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57273-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572732","9783540480327"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57273-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}