{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:48Z","timestamp":1760202468933,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5191,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1016\/s0304-3975(98)00323-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"233-248","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":31,"title":["Uniform random generation of decomposable structures using floating-point arithmetic"],"prefix":"10.1016","volume":"218","author":[{"given":"Alain","family":"Denise","sequence":"first","affiliation":[]},{"given":"Paul","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00323-5_BIB1","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/0304-3975(94)00086-7","article-title":"Uniform generation of a Motzkin word","volume":"134","author":"Alonso","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00323-5_BIB2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/BF02522824","article-title":"A linear-time algorithm for the generation of trees","volume":"17","author":"Alonso","year":"1997","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/S0304-3975(98)00323-5_BIB3","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/357084.357091","article-title":"Uniform random generation of balanced parenthesis strings","volume":"2","author":"Arnold","year":"1980","journal-title":"ACM Trans. Program. Lang. Systems"},{"year":"1991","author":"Char","key":"10.1016\/S0304-3975(98)00323-5_BIB4"},{"year":"1997","series-title":"Qualit\u00e9 des calculs sur ordinateur, Vers des arithm\u00e9tiques plus fiables?","author":"Daumas","key":"10.1016\/S0304-3975(98)00323-5_BIB5"},{"issue":"1","key":"10.1016\/S0304-3975(98)00323-5_BIB6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(95)00200-6","article-title":"G\u00e9nration al\u00e9atoire et uniforme de mots de langages rationnels","volume":"159","author":"Denise","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00323-5_BIB7_1","series-title":"Proc. FPSAC'98 (software demonstration)","article-title":"CS: a MuPAD package for counting and randomly generating combinatorial structures","author":"Denise","year":"1998"},{"issue":"1","key":"10.1016\/S0304-3975(98)00323-5_BIB7_2","first-page":"23","volume":"8","author":"Denise","year":"1998","journal-title":"MathPAD"},{"key":"10.1016\/S0304-3975(98)00323-5_BIB8","unstructured":"P. Flajolet, P. Zimmermann, B.V. Cutsem, A calculus of random generation: Unlabelled structures, in preparation."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(98)00323-5_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","article-title":"A calculus for the random generation of labelled combinatorial structures","volume":"132","author":"Flajolet","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00323-5_BIB10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(95)00025-8","article-title":"Random generation of words in an algebraic language in linear binary space","volume":"54","author":"Goldwurm","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0304-3975(98)00323-5_BIB11","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0212044","article-title":"Uniform random generation of strings in a context-free language","volume":"12","author":"Hickey","year":"1983","journal-title":"SIAM J. Comput."},{"journal-title":"Tech. Rep. ANSI-IEEE Standard 754-1985","year":"1985","key":"10.1016\/S0304-3975(98)00323-5_BIB12"},{"key":"10.1016\/S0304-3975(98)00323-5_BIB13","series-title":"Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms","first-page":"551","article-title":"Counting and random generation of strings in regular languages","author":"Kannan","year":"1995"},{"key":"10.1016\/S0304-3975(98)00323-5_BIB14","article-title":"The Art of Computer Programming","volume":"vol. 2","author":"Knuth","year":"1969"},{"issue":"2","key":"10.1016\/S0304-3975(98)00323-5_BIB15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(94)90033-7","article-title":"Generating words in a context free language uniformly at random","volume":"49","author":"Mairson","year":"1994","journal-title":"Inform Process. Lett."},{"year":"1978","series-title":"Combinatorial Algorithms","author":"Nijenhuis","key":"10.1016\/S0304-3975(98)00323-5_BIB16"},{"issue":"2","key":"10.1016\/S0304-3975(98)00323-5_BIB17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/178365.178368","article-title":"Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable","volume":"20","author":"Salvy","year":"1994","journal-title":"ACM Trans. Math. Software"},{"issue":"1","key":"10.1016\/S0304-3975(98)00323-5_BIB18","first-page":"38","article-title":"Ga\u00efa: a package for the random generation of combinatorial structures","volume":"1","author":"Zimmermann","year":"1994","journal-title":"MapleTechnol."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003235?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003235?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:47Z","timestamp":1759625507000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598003235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0304397598003235"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00323-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1999,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Uniform random generation of decomposable structures using floating-point arithmetic","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00323-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}