Efficient generation of the binary reflected gray code and its applications

Cited In (61)

A loopless algorithm for generating the permutations of a multiset
Combinatorial generation via permutation languages. I. Fundamentals
Design of reinforced concrete road vaults by heuristic optimization
Gray code enumeration of families of integer partitions
Gray codes for reflection groups
A general exhaustive generation algorithm for Gray structures
The Towers of Hanoi Problem
A heuristic approach for constructing symmetric Gray codes
The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
Efficient Computation of Middle Levels Gray Codes
Solution of some multi-dimensional lattice path parity difference recurrence relations
Gray codes from antimatroids
Loopless Gray code enumeration and the Tower of Bucharest
A computer-assisted optimal depth lower bound for nine-input sorting networks
A minimum-change version of the Chung-Feller theorem for Dyck paths
A minimum-change version of the Chung-Feller theorem for Dyck paths
A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
Monotone Gray codes and the middle levels problem
Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
A new algorithm for generating derangements
Loop Free Generation ofK-Ary Trees
Regular numeral systems for data structures
Prefix partitioned Gray codes for particular cross-bifix-free sets
Title not available (Why is that?)
Embedding the incomplete hypercube in books
An algorithm for generating subsets of fixed size with a strong minimal change property
A loopless algorithm for generating binary tree sequences
Generating permutations of a bag by interchanges
On \(m\)-ary Gray codes
Monomer-dimer tatami tilings of square regions
Choosing the capacity of arcs with constraint on flow delay time
Data compression and Gray-code sorting
A general class of resource tradeoffs
The bipancycle-connectivity of the hypercube
On a Combinatorial Generation Problem of Knuth
Fast transforms over finite fields of characteristic two
Random Gray code and its performance analysis for image hashing
Amortized efficiency of generating planar paths in convex position
Properties of the cycles that contain all vectors of weight \(\le k\)
The coolest way to generate combinations
On cyclic 〈m,n〉-enumerations
Sorting nine inputs requires twenty-five comparisons
Gray-Codes
Whole mirror duplication-random loss model and pattern avoiding permutations
A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle
Trimming and gluing Gray codes
Finding parity difference by involutions
On the central levels problem
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
A constant-time algorithm for middle levels Gray codes
Gray codes in graphs of subsets
Embedding cycles and meshes onto incomplete hypercubes
Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
A low spatial complexity algorithm to generate combinations with the strong minimal change property
Efficient computation of statistical procedures based on all subsets of a specified size
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity
Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields
Combinatorial generation via permutation languages. III: Rectangulations
Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length
Loopless Algorithms And SchrÖder Trees

This page was built for publication: Efficient generation of the binary reflected gray code and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099520)