{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T02:52:59Z","timestamp":1721875979684},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990,1]]},"DOI":"10.1016\/0167-8191(90)90125-s","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"119-125","source":"Crossref","is-referenced-by-count":4,"title":["A systolic design for generating combinations in lexicographic order"],"prefix":"10.1016","volume":"13","author":[{"given":"J.C","family":"Tsay","sequence":"first","affiliation":[]},{"given":"C.J","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90125-S_BIB1","series-title":"Parallel Sorting Algorithms","author":"Akl","year":"1985"},{"key":"10.1016\/0167-8191(90)90125-S_BIB2","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\/0167-8191(90)90125-S_BIB3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01933707","article-title":"Parallel generating of permutations and combinations","volume":"26","author":"Chen","year":"1986","journal-title":"BIT"},{"key":"10.1016\/0167-8191(90)90125-S_BIB4","series-title":"Advances in Computers","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60033-9","article-title":"The structure of parallel algorithms","author":"Kung","year":"1980"},{"key":"10.1016\/0167-8191(90)90125-S_BIB5","first-page":"867","article-title":"On supercomputing with systolic\/wavefront array processors","volume":"72","author":"Kung","year":"1984"},{"key":"10.1016\/0167-8191(90)90125-S_BIB6","series-title":"VLSI Array Processors","author":"Kung","year":"1988"},{"key":"10.1016\/0167-8191(90)90125-S_BIB7","first-page":"41","article-title":"Optimizing synchronous systems","volume":"1","author":"Leiserson","year":"1983","journal-title":"J. VLSI Comput. Syst."},{"key":"10.1016\/0167-8191(90)90125-S_BIB8","series-title":"Introduction to VLSI System","article-title":"Highly concurrent system","author":"Mead","year":"1980"},{"key":"10.1016\/0167-8191(90)90125-S_BIB9","first-page":"113","article-title":"On the design of algorithms for VLSI systolic arrays","volume":"71","author":"Moldovan","year":"1983"},{"issue":"1","key":"10.1016\/0167-8191(90)90125-S_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","article-title":"Partitioning and mapping algorithms into fixed size systolic arrays","volume":"35","author":"Moldovan","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90125-S_BIB11","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"issue":"2","key":"10.1016\/0167-8191(90)90125-S_BIB12","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(90)90125-S_BIB13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0196-6774(84)90031-2","article-title":"An efficient algorithm for generating all k-subsets (1 \u2a7d k \u2a7d m \u2a7d n) of the set {1, 2, \u2026, n} in lexicographic order","volume":"5","author":"Semba","year":"1984","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/0167-8191(90)90125-S_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1093\/comjnl\/31.1.65","article-title":"Applications of a subset-generation algorithm to base enumeration, knapsack and minimal covering problems","volume":"31","author":"Stojmenovic","year":"1988","journal-title":"Comput. J."},{"key":"10.1016\/0167-8191(90)90125-S_BIB15","series-title":"Introduction to Computer Architectures","article-title":"Parallel computers","author":"Stone","year":"1980"},{"key":"10.1016\/0167-8191(90)90125-S_BIB16","series-title":"Proc. Internat. Comput. Symp.","first-page":"1006","article-title":"Parallel generation of combinations","author":"Tang","year":"1984"},{"issue":"1","key":"10.1016\/0167-8191(90)90125-S_BIB17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TC.1984.5009314","article-title":"Parrallelism and array processing","volume":"33","author":"Zakharov","year":"1984","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090125S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090125S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:23Z","timestamp":1551086723000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090125S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["016781919090125S"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90125-s","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}