Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference19 articles.
1. S. G. Akl,A new algorithm for generating derangements, BIT 20 (1980), 2.
2. G. H. Chen, Maw-Sheng Chern,Parallel generation of permutations and combinations, BIT 26 (1986), 277–283.
3. M. Cosnard, A. G. Ferreira,Generating permutations on a VLSI suitable linear network, The Computer Journal 32, 6 (1989), 571–573.
4. M. C. Er,Efficient generation of stack permutations in lexicographical order, Journal of Information Processing 9, 1 (1985), 17–19.
5. M. Garey, D. S. Johnson,Computers and Intractability. A Guide to the Theory of NP-completeness, W. H. Freeman and Co., San Francisco (1979).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献