Pages that link to "Item:Q2784451"
From MaRDI portal
The following pages link to Generating bracelets in constant amortized time (Q2784451):
Displaying 22 items.
- An Eades-McKay algorithm for well-formed parentheses strings (Q293461) (← links)
- A fast algorithm to generate necklaces with fixed content (Q1400003) (← links)
- Generating bracelets with fixed content (Q1939284) (← links)
- Compression of periodic complementary sequences and applications (Q2256101) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- Counting and ordering periodic stationary solutions of lattice Nagumo equations (Q2275219) (← links)
- Charm bracelets and their application to the construction of periodic Golay pairs (Q2345628) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Binary quadratic forms as dessins (Q2397943) (← links)
- Generating fixed density bracelets of arbitrary base (Q2875290) (← links)
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
- Non-crossing Tree Realizations of Ordered Degree Sequences (Q2964006) (← links)
- Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns (Q2980895) (← links)
- COMPUTATIONALLY EFFICIENT RECURSIONS FOR TOP-ORDER INVARIANT POLYNOMIALS WITH APPLICATIONS (Q3551021) (← links)
- (Q4252356) (← links)
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
- An Efficient Algorithm for Generating Necklaces with Fixed Density (Q4943839) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order (Q5091834) (← links)
- On extremal and near-extremal self-dual ternary codes (Q6494946) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- Enumerating \(m\)-length walks in directed graphs with constant delay (Q6547915) (← links)