Generating Bracelets in Constant Amortized Time

DOI10.1137/S0097539700377037zbMath0992.68153OpenAlexW2060034273MaRDI QIDQ2784451

Joe Sawada

Publication date: 23 April 2002

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539700377037

zbMATH Keywords

necklaceCAT algorithmgeneratebraceletforbidden substring

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics on words (68R15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (14)

Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Binary quadratic forms as dessins ⋮ The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Non-crossing Tree Realizations of Ordered Degree Sequences ⋮ Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ COMPUTATIONALLY EFFICIENT RECURSIONS FOR TOP-ORDER INVARIANT POLYNOMIALS WITH APPLICATIONS ⋮ Compression of periodic complementary sequences and applications ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Counting and ordering periodic stationary solutions of lattice Nagumo equations ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Charm bracelets and their application to the construction of periodic Golay pairs ⋮ Generating fixed density bracelets of arbitrary base

This page was built for publication: Generating Bracelets in Constant Amortized Time