Generating bracelets in constant amortized time
From MaRDI portal
Recommendations
- Generating bracelets with fixed content
- Ranking Bracelets in Polynomial Time.
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- scientific article; zbMATH DE number 1305469
- A fast algorithm to generate necklaces with fixed content
- Generating fixed density bracelets of arbitrary base
- Generating random braids
- Constant time generation of derangements
- Simple constant amortized time generation of fixed length numeric partitions
- On O(1) time algorithms for combinatorial generation
Cited in
(23)- The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
- A fast algorithm to generate necklaces with fixed content
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- Generating bracelets with fixed content
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
- Non-crossing tree realizations of ordered degree sequences
- An Eades-McKay algorithm for well-formed parentheses strings
- Counting and ordering periodic stationary solutions of lattice Nagumo equations
- COMPUTATIONALLY EFFICIENT RECURSIONS FOR TOP-ORDER INVARIANT POLYNOMIALS WITH APPLICATIONS
- Binary quadratic forms as dessins
- Charm bracelets and their application to the construction of periodic Golay pairs
- Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
- Listing words in free groups
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- On extremal and near-extremal self-dual ternary codes
- Compression of periodic complementary sequences and applications
- scientific article; zbMATH DE number 1305469 (Why is no real title available?)
- Generating fixed density bracelets of arbitrary base
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Circularly compatible ones, D-circularity, and proper circular-arc bigraphs
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Enumerating \(m\)-length walks in directed graphs with constant delay
This page was built for publication: Generating bracelets in constant amortized time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784451)
