{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:33:42Z","timestamp":1648920822796},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1007\/bf01932702","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T05:47:32Z","timestamp":1122270452000},"page":"23-36","source":"Crossref","is-referenced-by-count":9,"title":["A systolic generation of combinations"],"prefix":"10.1007","volume":"29","author":[{"given":"Chau-Jy","family":"Lin","sequence":"first","affiliation":[]},{"given":"Jong-Chuang","family":"Tsay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01932702_CR1","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"E. M. Reingold","year":"1977","unstructured":"E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice, Prentice-Hall INC. Englewood Cliffs, New Jersey, 1977."},{"key":"BF01932702_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01939357","volume":"26","author":"B. Chan","year":"1986","unstructured":"B. Chan and S. G. Akl,Generating combinations in parallel, BIT 26 (1986), pp. 2\u20136.","journal-title":"BIT"},{"key":"BF01932702_CR3","volume-title":"Parallel Sorting Algorithms","author":"S. G. Akl","year":"1985","unstructured":"S. G. Akl,Parallel Sorting Algorithms, Academic Press, Orlando, Florida, 1985."},{"key":"BF01932702_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01933707","volume":"26","author":"G. H. Chen","year":"1986","unstructured":"G. H. Chen and M. S. Chern,Parallel generating of permutations and combinations, BIT 26 (1986), pp. 277\u2013283.","journal-title":"BIT"},{"key":"BF01932702_CR5","unstructured":"C. Y. Tag, M. W. Du, and R. C. T. Lee,Parallel generation of combinations, in Proc. Int'l. Comput. Symp., Taipei, Taiwan, 1984, pp. 1006\u20131010."},{"key":"BF01932702_CR6","first-page":"65","volume-title":"Advances in Computers","author":"H. T. Kung","year":"1980","unstructured":"H. T. Kung,The structure of parallel algorithms, inAdvances in Computers, M. C. Yovits, Ed. Academic Press, New York, 1980, pp. 65\u2013112."},{"key":"BF01932702_CR7","unstructured":"H. S. Stone,Parallel computers, inIntroduction to Computer Architectures, 1980."},{"key":"BF01932702_CR8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0196-6774(84)90031-2","volume":"5","author":"I. Semba","year":"1984","unstructured":"I. Semba,An efficient algorithm for generating all k-subsets (1 \u2264 k \u2264 m \u2264 n) of the set {1,2,...,n} in lexicographic order, Journal of Algorithms 5, 1984, pp. 281\u2013283.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"BF01932702_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/356689.356692","volume":"9","author":"R. Sedgewick","year":"1977","unstructured":"R. Sedgewick,Permutation generation methods, Computing Surveys, Vol. 9, No. 2. 1977, pp. 137\u2013164.","journal-title":"Computing Surveys"},{"issue":"1","key":"BF01932702_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TC.1984.5009314","volume":"C-33","author":"V. Zakharov","year":"1984","unstructured":"V. Zakharov,Parallelism and array processing IEEE Trans. on Computers, Vol. C-33, No. 1, 1984, pp. 45\u201378.","journal-title":"IEEE Trans. on Computers"},{"issue":"1","key":"BF01932702_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/PROC.1983.12532","volume":"71","author":"D. I. Moldovan","year":"1983","unstructured":"D. I. Moldovan,On the design of algorithms for VLSI systolic arrays, Proc. IEEE, Vol. 71, No. 1, 1983, pp. 113\u2013120.","journal-title":"Proc. IEEE"},{"key":"BF01932702_CR12","doi-asserted-by":"crossref","unstructured":"D. I. Moldovan and J. A. B. Fortes,Partitioning and mapping algorithms into fixed size systolic arrays, IEEE Trans. on Computers, Vol. C-35, No. 12.","DOI":"10.1109\/TC.1986.1676652"},{"issue":"1","key":"BF01932702_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/321864.321873","volume":"22","author":"S. Sahni","year":"1975","unstructured":"S. Sahni,Approximate algorithms for the 0\/1 knapsack problem, J. ACM, Vol. 22, No. 1, 1975, pp. 115\u2013124.","journal-title":"J. ACM"},{"key":"BF01932702_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01934178","volume":"27","author":"G. H. Chen","year":"1987","unstructured":"G. H. Chen, M. S. Chern, and R. C. T. Lee,A new systolic architecture for convex hull and half-plane intersection problems, BIT 27, 1987, pp. 141\u2013147.","journal-title":"BIT"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01932702.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01932702\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01932702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:59:41Z","timestamp":1557449981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01932702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["BF01932702"],"URL":"https:\/\/doi.org\/10.1007\/bf01932702","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}