A new algorithm for generating derangements-Reference-Cited by-同舟云学术

A new algorithm for generating derangements

Published:1980-03 Issue:1 Volume:20 Page:2-7
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Akl Selim G.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

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

Reference8 articles.

1. S. G. Akl,An Algorithm for generating derangements, Technical Report No. 78-71, DOCIS, Queen's University, Kingston, Ontario, Canada.

2. J. R. Bitner, G. Ehrlich and E. M. Reingold,Efficient generation of the binary reflected Gray code and its applications, CACM, Vol. 19, No. 9 (1976), 517–521.

3. G. Ehrlich,Loopless algorithms for generating permutations, combinations and other combinatorial configurations, JACM, Vol. 20, No. 3 (1973), 500–513.

4. S. Even,Algorithmic Combinatorics, Macmillan, New York, 1973, pp. 55–56.

5. E. M. Reingold, J. Nievergelt and N. Deo,Combinatorial Algorithms, Solutions Manual, Prentice-Hall, Englewood Cliffs, New Jersey, 1978, pp. 111–119.

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

1. Ranking and unranking restricted permutations;Discrete Applied Mathematics;2024-10

2. The Feller Coupling for random derangements;Stochastic Processes and their Applications;2021-09

3. Efficient generation of random derangements with the expected distribution of cycle lengths;Computational and Applied Mathematics;2020-08-13

4. More restrictive Gray codes for some classes of pattern avoiding permutations;Information Processing Letters;2009-06

5. Gray code for derangements;Discrete Applied Mathematics;2004-05