Author:
Chen G. H.,Chern Maw-Sheng
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference7 articles.
1. G. H. Chen, Maw-Sheng Chern and R. C. T. Lee,Systolic algorithms for computational geometry, in Proc. National Comput. Symp., Kaohsiung, Taiwan, (1985), 1647–1656.
2. P. Gupta and G. P. Bhattacharjee,Parallel generation of permutations, The Computer J., 26, 2(1983), 97–105.
3. M. Mor and A. S. Fraenkel,Permutation generation on vector processors, The Computer J., 25, 4(1982), 423–428.
4. S. Sahni,Approximate algorithms for the 0/1-knapsack problem, J. ACM, 22, 1(1975), 115–124.
5. I. Semba,An efficient algorithm for generating all K-subsets (1 ≦ k ≦ m ≦ n) of the set {1, 2, ..., n} in lexicographic order, J. Algorithms, 5, 2 (1984), 281–283.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献