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