Efficient generation of the binary reflected gray code and its applications

Cited in

(66)

Loopless Algorithms And SchrÖder Trees
A loopless algorithm for generating the permutations of a multiset
Space-optimal quasi-Gray codes with logarithmic read complexity
Design of reinforced concrete road vaults by heuristic optimization
Gray code enumeration of families of integer partitions
Gray codes for reflection groups
On a combinatorial generation problem of Knuth
A general exhaustive generation algorithm for Gray structures
The Towers of Hanoi Problem
A low spatial complexity algorithm to generate combinations with the strong minimal change property
A heuristic approach for constructing symmetric Gray codes
Solution of some multi-dimensional lattice path parity difference recurrence relations
The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
Gray codes from antimatroids
Loopless Gray code enumeration and the Tower of Bucharest
Efficient Computation of Middle Levels Gray Codes
A computer-assisted optimal depth lower bound for nine-input sorting networks
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
A minimum-change version of the Chung-Feller theorem for Dyck paths
A minimum-change version of the Chung-Feller theorem for Dyck paths
Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
Combinatorial generation via permutation languages. I: Fundamentals
Monotone Gray codes and the middle levels problem
A new algorithm for generating derangements
Regular numeral systems for data structures
Loop Free Generation ofK-Ary Trees
Algorithm 1052: evaluating a Boolean polynomial on all possible inputs
Embedding the incomplete hypercube in books
An algorithm for generating subsets of fixed size with a strong minimal change property
Efficient generation of rectangulations via permutation languages
scientific article; zbMATH DE number 706769 (Why is no real title available?)
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
Data compression and Gray-code sorting
Choosing the capacity of arcs with constraint on flow delay time
Efficient computation of statistical procedures based on all subsets of a specified size
A general class of resource tradeoffs
The bipancycle-connectivity of the hypercube
Random Gray code and its performance analysis for image hashing
Amortized efficiency of generating planar paths in convex position
A note on Beckett-Gray codes and the relationship of Gray codes to data structures
Fast transforms over finite fields of characteristic two
Efficiently enumerating spanning trees of k-trees
On the central levels problem
The coolest way to generate combinations
Properties of the cycles that contain all vectors of weight k
Sorting nine inputs requires twenty-five comparisons
On cyclic 〈m,n〉-enumerations
Gray-Codes
Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields
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
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
On the central levels problem
Combinatorial generation via permutation languages. III: Rectangulations
Classical bounds on two-outcome bipartite Bell expressions and linear prepare-and-measure witnesses: Efficient computation in parallel environments such as graphics processing units
Gray codes in graphs of subsets
A constant-time algorithm for middle levels Gray codes
Embedding cycles and meshes onto incomplete hypercubes
Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length
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

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)