Efficient generation of the binary reflected gray code and its applications

Cited in

(60)

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