More on permutation generation methods-Reference-Cited by-同舟云学术

More on permutation generation methods

Published:1979-12 Issue:4 Volume:23 Page:357-365
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Lipski W.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02254864.pdf

Reference5 articles.

1. Boothroyd, J.: PERM (Algorithm 6). Computer Bulletin9, 104 (1965).

2. Boothroyd, J.: Permutation of the elements of a vector (Algorithm 29); Fast permutation of the elements of a vector (Algorithm 30). Computer J.10, 310–312 (1967).

3. Heap, B. R.: Permutations by interchanges. Computer J.6, 293–294 (1963).

4. Sedgewick, R.: Permutation generation methods. ACM Computing Surveys9, 137–163 (1977).

5. Wells, M. B.: Generation of permutations by transposition. Math. Comp.15, 192–195 (1961).

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. DDCA-WSN: A Distributed Data Compression and Aggregation Approach for Low Resources Wireless Sensors Networks;International Journal of Wireless Information Networks;2022-01-14

2. A Unified Framework to Discover Permutation Generation Algorithms;The Computer Journal;2021-11-17

3. Determining distinct circuit in complete graphs using permutation;AIP Conference Proceedings;2017

4. Application of half butterfly method in listing permutation;AIP Conference Proceedings;2016

5. 1960–1979;A Chronicle of Permutation Statistical Methods;2014