Pages that link to "Item:Q4376203"
From MaRDI portal
The following pages link to A Survey of Combinatorial Gray Codes (Q4376203):
Displaying 50 items.
- On the spectrum of Hamiltonian cycles in the \(n\)-cube (Q1984529) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- Synthesis of test sequences with a given switching activity (Q2139488) (← links)
- A shift Gray code for fixed-content Łukasiewicz words (Q2169973) (← links)
- \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\) (Q2175776) (← links)
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle (Q2189829) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- Algorithms for optimal replica placement under correlated failure in hierarchical failure domains (Q2290650) (← links)
- A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
- Existence of a maximum balanced matching in the hypercube (Q2320869) (← links)
- More restricted growth functions: Gray codes and exhaustive generation (Q2364420) (← links)
- Hamiltonian paths with prescribed edges in hypercubes (Q2370437) (← links)
- Perfect matchings extend to Hamilton cycles in hypercubes (Q2384812) (← links)
- Efficient generation of restricted growth words (Q2444851) (← links)
- Integer representations towards efficient counting in the bit probe model (Q2447536) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Cyclic sequences of \(k\)-subsets with distinct consecutive unions (Q2468032) (← links)
- Test sequence construction using minimum information on the tested system (Q2498283) (← links)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations (Q2502171) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
- On the central levels problem (Q2692785) (← links)
- Proof of the middle levels conjecture (Q2809275) (← links)
- The Greedy Gray Code Algorithm (Q2842188) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
- Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems (Q3092335) (← links)
- (Q3098785) (← links)
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (Q3117226) (← links)
- On locally balanced gray codes (Q3186855) (← links)
- On combinatorial Gray codes with distance 3 (Q3225885) (← links)
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION (Q3434277) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q3452851) (← links)
- (Q3471700) (← links)
- Matching graphs of Hypercubes and Complete Bipartite Graphs (Q3503492) (← links)
- Generating all distributions of objects to bins (Q3615543) (← links)
- Hamiltonian threshold for strong products of graphs (Q3630836) (← links)
- Finding Lean Induced Cycles in Binary Hypercubes (Q3637155) (← links)
- Combinatorial families that are exponentially far from being listable in Gray code sequence (Q4216327) (← links)
- Loopless Algorithms And SchrÖder Trees (Q4464414) (← links)
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
- Note on Gray codes for permutation lists (Q4928273) (← links)
- Rethinking arithmetic for deep neural networks (Q4993501) (← links)
- (Q5002744) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
