{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T20:11:07Z","timestamp":1710274267353},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/j.ipl.2004.02.006","type":"journal-article","created":{"date-parts":[[2004,3,12]],"date-time":"2004-03-12T10:20:08Z","timestamp":1079086808000},"page":"181-186","source":"Crossref","is-referenced-by-count":8,"title":["Constant time generation of derangements"],"prefix":"10.1016","volume":"90","author":[{"given":"James F.","family":"Korsh","sequence":"first","affiliation":[]},{"given":"Paul S.","family":"LaFollette","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2004.02.006_BIB001","doi-asserted-by":"crossref","unstructured":"J. Baril, V. Vajnovszki, Gray code for derangements, Discrete Appl. Math., in press; doi: 10.1016\/j.dam.2003.06.002","DOI":"10.1016\/j.dam.2003.06.002"},{"key":"10.1016\/j.ipl.2004.02.006_BIB002","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","article-title":"An algorithm for generating subsets of fixed size with a strong minimal change property","volume":"19","author":"Eades","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.ipl.2004.02.006_BIB003","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1145\/321765.321781","article-title":"Loopless algorithms for generating permutations, combinations, and other combinatorial objects","volume":"20","author":"Ehrlich","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/j.ipl.2004.02.006_BIB004","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1016548222238","article-title":"Loopless generation of linear extensions of a poset","volume":"19","author":"Korsh","year":"2002","journal-title":"Order"},{"key":"10.1016\/j.ipl.2004.02.006_BIB005","unstructured":"J.F. Korsh, P.S. LaFollette, Loopless array generation of multiset permutations, CIS Department Technical Report, Temple University, Philadelphia, PA, October 2002"},{"key":"10.1016\/j.ipl.2004.02.006_BIB006","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1006\/jagm.1997.0889","article-title":"Generating multiset permutations in constant time","volume":"25","author":"Korsh","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/j.ipl.2004.02.006_BIB007","doi-asserted-by":"crossref","unstructured":"T. Takaoka, An O(1) time algorithm for generating multiset permutations, in: ISAAC 99, in: Lecture Notes in Comput. Sci., vol. 1741, Springer, Berlin, pp. 237\u2013246","DOI":"10.1007\/3-540-46632-0_25"},{"key":"10.1016\/j.ipl.2004.02.006_BIB008","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0020-0190(98)00155-0","article-title":"On the loopless generation of binary tree sequences","volume":"68","author":"Vajnovszki","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.ipl.2004.02.006_BIB009","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1093\/comjnl\/44.4.292","article-title":"On O(1) time algorithms for combinatorial generation","volume":"44","author":"Xiang","year":"2001","journal-title":"Comp. J."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019004000493?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019004000493?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T16:24:13Z","timestamp":1585671853000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019004000493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0020019004000493"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2004.02.006","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}