Generating bracelets in constant amortized time

35Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (i.e., listing) k-ary bracelets. Using simple bounding techniques, we prove that the algorithm is optimal in the sense that the running time is proportional to the number of bracelets produced. This is an improvement by a factor of n (where n is the length of the bracelets being generated) over the fastest, previously known algorithm to generate bracelets. © 2001 Society for Industrial and Applied Mathematics.

Cite

CITATION STYLE

APA

Sawada, J. (2001). Generating bracelets in constant amortized time. SIAM Journal on Computing, 31(1), 259–268. https://doi.org/10.1137/S0097539700377037

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free