The following pages link to Balanced Gray codes (Q1379168):
Displaying 21 items.
- Synthetic sequence design for signal location search (Q378252) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- Balancing cyclic \(R\)-ary Gray codes. II. (Q1010863) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- Binary Gray codes with long bit runs (Q1408531) (← links)
- Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes (Q1634365) (← links)
- Antipodal Gray codes (Q1827713) (← links)
- Fair Hamilton decompositions of complete multipartite graphs (Q1850614) (← links)
- A heuristic approach for constructing symmetric Gray codes (Q1883151) (← links)
- On the spectrum of Hamiltonian cycles in the \(n\)-cube (Q1984529) (← links)
- Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
- Existence of a maximum balanced matching in the hypercube (Q2320869) (← links)
- A simple proof for the existence of exponentially balanced Gray codes (Q2571312) (← links)
- Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations (Q2973273) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- Construction of uniform Gray codes (Q3975295) (← links)
- (Q4048928) (← links)
- Some classes of bipartite graphs induced by Gray codes (Q5006626) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- On flips in planar matchings (Q5919054) (← links)
