Generating Combinations by Three Basic Operations
暂无分享,去创建一个
[2] E. Gilbert. Gray codes and paths on the N-cube , 1958 .
[3] Dana S. Richards. Data Compression and Gray-Code Sorting , 1986, Inf. Process. Lett..
[4] David Thomas,et al. The Art in Computer Programming , 2001 .
[5] Carla Savage,et al. A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..
[6] Dennis E. White,et al. Combinatorial Gray codes , 1980, SIAM J. Comput..
[7] S. Gill Williamson,et al. Doubly adjacent gray codes for the symmetric group , 1993 .
[8] Brendan D. McKay,et al. An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property , 1984, Inf. Process. Lett..
[9] Donald T. Tang,et al. Distance-2 Cyclic Chaining of Constant-Weight Codes , 1973, IEEE Transactions on Computers.
[10] N. Sundararajan,et al. Data structure based on Gray code encoding for graphics and image processing , 1990, Optics & Photonics.
[11] Ming-Syan Chen,et al. Subcube Allocation and Task Migration in Hypercube Multiprocessors , 1990, IEEE Trans. Computers.
[12] Gideon Ehrlich,et al. Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations , 1973, JACM.
[13] P. Diaconis,et al. Gray codes for randomization procedures , 1994 .
[14] Chin-Chen Chang,et al. Symbolic Gray Code As A Data Allocation Scheme For Two-Disc Systems , 1992, Comput. J..
[15] Frank Ruskey,et al. Generating Combinations by Prefix Shifts , 2005, COCOON.