{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T06:22:57Z","timestamp":1649053377170},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/s0167-8191(06)80018-9","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T21:57:34Z","timestamp":1188943054000},"page":"353-361","source":"Crossref","is-referenced-by-count":3,"title":["An optimal parallel algorithm for generating permutations in minimal change order"],"prefix":"10.1016","volume":"20","author":[{"given":"Jong-Chuang","family":"Tsay","sequence":"first","affiliation":[]},{"given":"Wei-Ping","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0167-8191(06)80018-9_bib1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1093\/comjnl\/30.5.433","article-title":"Adaptive and optimal parallel algorithms for enumerating permutations and combinations","volume":"30","author":"Akl","year":"1987","journal-title":"Computer J."},{"key":"10.1016\/S0167-8191(06)80018-9_bib2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(89)90192-0","article-title":"An optimal parallel algorithm for generating combinations","volume":"33","author":"Akl","year":"1989","journal-title":"Informat. Processing Lett."},{"issue":"3","key":"10.1016\/S0167-8191(06)80018-9_bib3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01933707","article-title":"Parallel generation of permutations and combinations","volume":"26","author":"Chen","year":"1986","journal-title":"BIT"},{"issue":"2","key":"10.1016\/S0167-8191(06)80018-9_bib4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/comjnl\/26.2.97","article-title":"Parallel generation of permutations","volume":"26","author":"Gupta","year":"1983","journal-title":"Comput. J."},{"issue":"83","key":"10.1016\/S0167-8191(06)80018-9_bib5","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","article-title":"Generation of Permutations by adjacent transposition","volume":"17","author":"Johnson","year":"1963","journal-title":"Math. of Computat."},{"key":"10.1016\/S0167-8191(06)80018-9_bib6","author":"Kung","year":"1988"},{"key":"10.1016\/S0167-8191(06)80018-9_bib7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0167-8191(90)90049-F","article-title":"Parallel generation of permutations on systolic arrays","volume":"15","author":"Lin","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(06)80018-9_bib8","author":"Liu","year":"1968"},{"issue":"4","key":"10.1016\/S0167-8191(06)80018-9_bib9","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1093\/comjnl\/25.4.423","article-title":"Permutation generation on vector processors","volume":"25","author":"Mor","year":"1982","journal-title":"Comput. J."},{"key":"10.1016\/S0167-8191(06)80018-9_bib10","author":"Nijenhuis","year":"1978"},{"issue":"3","key":"10.1016\/S0167-8191(06)80018-9_bib11","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1093\/comjnl\/13.2.152","article-title":"Generation of permutation sequences: Part 1","volume":"13","author":"Ord-Smith","year":"1970","journal-title":"Comput J."},{"issue":"2","key":"10.1016\/S0167-8191(06)80018-9_bib12","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1093\/comjnl\/14.2.136","article-title":"Generation of Permutation Sequences: Part 2","volume":"14","author":"Ord-Smith","year":"1971","journal-title":"Comput. J."},{"key":"10.1016\/S0167-8191(06)80018-9_bib13","author":"Reingold","year":"1977"},{"issue":"2","key":"10.1016\/S0167-8191(06)80018-9_bib14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/356689.356692","article-title":"Permutation generation methods","volume":"9","author":"Sedgewick","year":"1977","journal-title":"Comput. Surv."},{"key":"10.1016\/S0167-8191(06)80018-9_bib15","series-title":"Proc. Internat. Comput. Symp.","first-page":"1006","article-title":"Parallel generation of combinations","author":"Tang","year":"1984"},{"key":"10.1016\/S0167-8191(06)80018-9_bib16","series-title":"Proc. First Workshop on Parallel Processing","first-page":"106","article-title":"An optimal parallel algorithm for generating permutations on linear array","author":"Wu","year":"1990"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819106800189?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819106800189?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T19:51:07Z","timestamp":1546631467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819106800189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["S0167819106800189"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(06)80018-9","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}