{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:37:54Z","timestamp":1648766274925},"reference-count":20,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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,5]]},"DOI":"10.1016\/0167-8191(94)90005-1","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"775-785","source":"Crossref","is-referenced-by-count":5,"title":["A systolic design for generating permutations in lexicographic order"],"prefix":"10.1016","volume":"20","author":[{"given":"Wei-Ping","family":"Lee","sequence":"first","affiliation":[]},{"given":"Jong-Chuang","family":"Tsay","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/0167-8191(94)90005-1_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":"Comp. J."},{"key":"10.1016\/0167-8191(94)90005-1_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":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0167-8191(94)90005-1_BIB3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01933707","article-title":"Parallel generation of permutations and computations","volume":"26","author":"Chen","year":"1986","journal-title":"BIT"},{"issue":"2","key":"10.1016\/0167-8191(94)90005-1_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":"4","key":"10.1016\/0167-8191(94)90005-1_BIB5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0020-0190(79)90016-4","article-title":"A technique for implementing backtract algorithms and its application","volume":"8","author":"Hitotumutu","year":"1979","journal-title":"Inform. Process. Lett."},{"issue":"83","key":"10.1016\/0167-8191(94)90005-1_BIB6","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. Computat."},{"key":"10.1016\/0167-8191(94)90005-1_BIB7","series-title":"VLSI Array Processor","author":"Kung","year":"1988"},{"key":"10.1016\/0167-8191(94)90005-1_BIB8","series-title":"Applied Combinatorial Mathematics","first-page":"20","article-title":"The machine tools of combinatorics","author":"Lehmer","year":"1964"},{"key":"10.1016\/0167-8191(94)90005-1_BIB9","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\/0167-8191(94)90005-1_BIB10","first-page":"113","article-title":"On the design of algorithms for VLSI systolic arrays","volume":"71","author":"Moldovan","year":"1983"},{"issue":"4","key":"10.1016\/0167-8191(94)90005-1_BIB11","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."},{"issue":"3","key":"10.1016\/0167-8191(94)90005-1_BIB12","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1093\/comjnl\/13.2.152","article-title":"Generation of permutation sequence: Part 1","volume":"13","author":"Ord-Smith","year":"1970","journal-title":"Comput. J."},{"issue":"2","key":"10.1016\/0167-8191(94)90005-1_BIB13","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1093\/comjnl\/14.2.136","article-title":"Generation of permutation sequence: Part 2","volume":"14","author":"Ord-Smith","year":"1971","journal-title":"Comput. J."},{"key":"10.1016\/0167-8191(94)90005-1_BIB14","first-page":"310","article-title":"Permutation of the elements of a vector in lexicographic order (Algorithm 28)","volume":"10","author":"Phillips","year":"1967","journal-title":"Comput. J."},{"key":"10.1016\/0167-8191(94)90005-1_BIB15","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"issue":"6","key":"10.1016\/0167-8191(94)90005-1_BIB16","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/367766.368177","article-title":"Permutation in lexicographic order (Algorithm 102)","volume":"5","author":"Schrak","year":"1962","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0167-8191(94)90005-1_BIB17","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. Surveys"},{"key":"10.1016\/0167-8191(94)90005-1_BIB18","series-title":"Proc. Internat. Comput. Symp.","first-page":"1006","article-title":"Parallel generation of combinations","author":"Tang","year":"1984"},{"key":"10.1016\/0167-8191(94)90005-1_BIB19","doi-asserted-by":"crossref","unstructured":"J.C. Tsay and W.P. Lee, An optimal parallel algorithm for generating permutations in minimal change order, submitted to Parallel Comput.","DOI":"10.1016\/S0167-8191(06)80018-9"},{"key":"10.1016\/0167-8191(94)90005-1_BIB20","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:0167819194900051?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194900051?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:28:46Z","timestamp":1551068926000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819194900051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0167819194900051"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90005-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}