Journal of the ACM (JACM)
Communications of the ACM
Remark on algorithm 246: Graycode [Z]
ACM Transactions on Mathematical Software (TOMS)
Algorithm 452: enumerating combinations of m out of n objects [G6]
Communications of the ACM
Algorithm 382: combinations of M out of N objects [G6]
Communications of the ACM
Algorithm 466: four combinatorial algorithm [G6]
Communications of the ACM
A computer assisted optimal depth lower bound for sorting networks with nine inputs
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
A text compression scheme that allows fast searching directly in the compressed file
ACM Transactions on Information Systems (TOIS)
The use of parallelization in the generation of binary linear codes
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
ACM Transactions on Mathematical Software (TOMS)
A Comparison of Combination Generation Methods
ACM Transactions on Mathematical Software (TOMS)
Three new combination algorithms with the minimal change property
Communications of the ACM
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A loopless algorithm for generating the permutations of a multiset
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Discrete Applied Mathematics
Time and work optimal simulation of basic reconfigurable meshes on hypercubes
Journal of Parallel and Distributed Computing
Embedding Imperceptible Patterns into Projected Images for Simultaneous Acquisition and Display
ISMAR '04 Proceedings of the 3rd IEEE/ACM International Symposium on Mixed and Augmented Reality
Properties of Gray and Binary Representations
Evolutionary Computation
Embedding the incomplete hypercube in books
Information Processing Letters
The Linear Layout of the Incomplete Hypercube
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
A loopless Gray code for rooted trees
ACM Transactions on Algorithms (TALG)
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
Journal of Discrete Algorithms
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
Mixed-Radix Gray Codes in Lee Metric
IEEE Transactions on Computers
Changing representations during search: A comparative study of delta coding
Evolutionary Computation
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Pure Parsimony Xor Haplotyping
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Embedding the incomplete hypercube in books
Information Processing Letters
A multi-view camera system for the generation of real-time occlusion-free scene video
Proceedings of the 29th DAGM conference on Pattern recognition
Fragility analysis of adaptive quantization-based image hashing
IEEE Transactions on Information Forensics and Security
Generating gray codes in o(1) worst-case time per word
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Whole mirror duplication-random loss model and pattern avoiding permutations
Information Processing Letters
Optimal waveband switching in optical ring networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On Generating the N-ary Reflected Gray Codes
IEEE Transactions on Computers
Pure Parsimony Xor Haplotyping
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
IEEE Transactions on Computers
Design of reinforced concrete road vaults by heuristic optimization
Advances in Engineering Software
Random Gray code and its performance analysis for image hashing
Signal Processing
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science
A loopless gray code for minimal signed-binary representations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Exploiting DLP Illumination Dithering for Reconstruction and Photography of High-Speed Scenes
International Journal of Computer Vision
Performance effects of node mappings on the IBM bluegene/l machine
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Tracking locations of moving hand-held displays using projected light
PERVASIVE'05 Proceedings of the Third international conference on Pervasive Computing
Gray, binary and real valued encodings: quad search and locality proofs
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
A new black and white visual cryptographic scheme for general access structures
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Foundations and Trends in Communications and Information Theory
Monomer-dimer tatami tilings of square regions
Journal of Discrete Algorithms
Tomographic reconstruction of transparent objects
EGSR'06 Proceedings of the 17th Eurographics conference on Rendering Techniques
Proceedings of the 4th ACM conference on Data and application security and privacy
Optimal Wavebanding in WDM Ring Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 48.25 |
Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the next element from the current one is constant. Applications to the generation of the combinations of n things taken k at a time, the compositions of integers, and the permutations of a multiset are discussed.