Pages that link to "Item:Q4099520"
From MaRDI portal
The following pages link to Efficient generation of the binary reflected gray code and its applications (Q4099520):
Displaying 50 items.
- Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images (Q404941) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Design of reinforced concrete road vaults by heuristic optimization (Q532469) (← links)
- Random Gray code and its performance analysis for image hashing (Q634032) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- Whole mirror duplication-random loss model and pattern avoiding permutations (Q656610) (← links)
- A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle (Q791323) (← links)
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- The bipancycle-connectivity of the hypercube (Q1007866) (← links)
- Embedding the incomplete hypercube in books (Q1044693) (← links)
- The coolest way to generate combinations (Q1044892) (← links)
- Gray-Codes (Q1055391) (← links)
- An algorithm for generating subsets of fixed size with a strong minimal change property (Q1060849) (← links)
- Data compression and Gray-code sorting (Q1075764) (← links)
- On \(m\)-ary Gray codes (Q1141125) (← links)
- The Towers of Hanoi Problem (Q1142217) (← links)
- Gray codes in graphs of subsets (Q1147162) (← links)
- A loopless algorithm for generating binary tree sequences (Q1182098) (← links)
- Generating permutations of a bag by interchanges (Q1197979) (← links)
- Solution of some multi-dimensional lattice path parity difference recurrence relations (Q1264151) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- Finding parity difference by involutions (Q1356534) (← links)
- Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups (Q1403878) (← links)
- Loopless Gray code enumeration and the Tower of Bucharest (Q1623270) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- Gray code enumeration of families of integer partitions (Q1805052) (← links)
- Monotone Gray codes and the middle levels problem (Q1805053) (← links)
- Gray codes for reflection groups (Q1825283) (← links)
- A general class of resource tradeoffs (Q1837531) (← links)
- A heuristic approach for constructing symmetric Gray codes (Q1883151) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- Monomer-dimer tatami tilings of square regions (Q1932371) (← links)
- Regular numeral systems for data structures (Q2139186) (← links)
- Fast transforms over finite fields of characteristic two (Q2229746) (← links)
- Choosing the capacity of arcs with constraint on flow delay time (Q2281352) (← links)
- A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
- The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube (Q2456377) (← links)
- Properties of the cycles that contain all vectors of weight \(\le k\) (Q2678985) (← links)
- On the central levels problem (Q2692785) (← links)
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (Q3117226) (← links)
- A computer-assisted optimal depth lower bound for nine-input sorting networks (Q3210158) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q3452851) (← links)
- A new algorithm for generating derangements (Q3870323) (← links)
- (Q4318151) (← links)
- Efficient computation of statistical procedures based on all subsets of a specified size (Q4337135) (← links)
- Loopless Algorithms And SchrÖder Trees (Q4464414) (← links)
- Embedding cycles and meshes onto incomplete hypercubes (Q4498114) (← links)
