The following pages link to (Q3816026):
Displaying 20 items.
- Random Gray code and its performance analysis for image hashing (Q634032) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- A construction of Gray codes inducing complete graphs (Q941339) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- A note on Gray code and odd-even merge (Q1102754) (← links)
- A technique for generating Gray codes (Q1152345) (← links)
- A method for coding linear displacements by overlapping sequences (Q1287455) (← links)
- Binary Gray codes with long bit runs (Q1408531) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- Monotone Gray codes and the middle levels problem (Q1805053) (← links)
- Antipodal Gray codes (Q1827713) (← links)
- On a characterization of the standard Gray code by using the edge type on a hypercube (Q1847379) (← links)
- On the spectrum of Hamiltonian cycles in the \(n\)-cube (Q1984529) (← links)
- The maximum length of circuit codes with long bit runs and a new characterization theorem (Q2329405) (← links)
- Local search and high precision Gray codes: Convergence results and neighborhoods (Q2776421) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q3452851) (← links)
- Near optimal single-track Gray codes (Q4887057) (← links)
- Single-track Gray codes (Q4896840) (← links)
- On distance Gray codes (Q5373994) (← links)
- Foundations of Genetic Algorithms (Q5703889) (← links)