{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T06:08:52Z","timestamp":1699423732394},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00198-0","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"15-28","source":"Crossref","is-referenced-by-count":6,"title":["A parallel algorithm for the generation of a permutation and applications"],"prefix":"10.1016","volume":"159","author":[{"given":"Laurent","family":"Alonso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Schott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00198-0_BIB1","series-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing","first-page":"1","article-title":"An O(nLog(n)) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/0304-3975(95)00198-0_BIB2","article-title":"Generating binary trees in parallel","author":"Akl","year":"1991"},{"key":"10.1016\/0304-3975(95)00198-0_BIB3","article-title":"Structures arborescentes: algorithmes de g\u00e9n\u00e9ration, probl\u00e8me de l'inclusion, relations maximin","author":"Alonso","year":"1992"},{"key":"10.1016\/0304-3975(95)00198-0_BIB4","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\/0304-3975(95)00198-0_BIB5","series-title":"Proc. SPAA'90","first-page":"95","article-title":"Parallel algorithms for generating random permutations on a shared memory machine","author":"Anderson","year":"1990"},{"key":"10.1016\/0304-3975(95)00198-0_BIB6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(94)90046-9","article-title":"The random generation of directed animals","volume":"127","author":"Barcucci","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00198-0_BIB7","first-page":"307","article-title":"Sorting networks and their applications","volume":"Vol. 32","author":"Batcher","year":"1968"},{"key":"10.1016\/0304-3975(95)00198-0_BIB8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01939357","article-title":"Generating combinations in parallel","volume":"26","author":"Chan","year":"1986","journal-title":"BIT"},{"key":"10.1016\/0304-3975(95)00198-0_BIB9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01933707","article-title":"Parallel generation of permutations and combinaisons","volume":"26","author":"Chen","year":"1986","journal-title":"BIT"},{"key":"10.1016\/0304-3975(95)00198-0_BIB10","series-title":"Analyse Combinatoire","author":"Comtet","year":"1970"},{"key":"10.1016\/0304-3975(95)00198-0_BIB11","series-title":"Introduction to ALGORITHMS","author":"Cormen","year":"1990"},{"key":"10.1016\/0304-3975(95)00198-0_BIB12","article-title":"M\u00e9thodes de g\u00e9n\u00e9ration d'objects combinatoires de grande taille et probl\u00e8me d'\u00e9num\u00e9ration","author":"Denise","year":"1994"},{"key":"10.1016\/0304-3975(95)00198-0_BIB13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0166-218X(89)90003-6","article-title":"Patterns in trees","volume":"25","author":"Dershowitz","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(95)00198-0_BIB14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0195-6698(13)80053-4","article-title":"The cycle lemma and some applications","volume":"11","author":"Dershowitz","year":"1990","journal-title":"European J. Combin."},{"key":"10.1016\/0304-3975(95)00198-0_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","article-title":"A calculus for the random generation of combinatorial structures","volume":"132","author":"Flajolet","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00198-0_BIB16","series-title":"Arbres et animaux, m\u00e9moire d'habilitation \u00e0 diriger les recherches","author":"Penaud","year":"1990"},{"issue":"2","key":"10.1016\/0304-3975(95)00198-0_BIB17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1051\/ita\/1985190201791","article-title":"Un proc\u00e9d\u00e9 it\u00e9ratif de d\u00e9nombrement d'arbres binaires et son application \u00e0 leur g\u00e9n\u00e9ration al\u00e9atoire","volume":"19","author":"R\u00e9my","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or."},{"issue":"2","key":"10.1016\/0304-3975(95)00198-0_BIB18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"c-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(95)00198-0_BIB19","first-page":"886","volume":"Vol. 1","year":"1990"},{"key":"10.1016\/0304-3975(95)00198-0_BIB20","article-title":"Combinatoire \u00e9num\u00e9rative","author":"Viennot","year":"1989","journal-title":"Notes de cours ENS Ulm"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001980?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001980?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:55:50Z","timestamp":1555390550000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595001980"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00198-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}