Efficient generation of the binary reflected gray code and its applications

Cited in

(67)

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

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)