Lexicographically least circular substrings
From MaRDI portal
Cites work
Cited in
(43)- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- Indexing Circular Patterns
- On a combinatorial generation problem of Knuth
- Flip-swap languages in binary reflected Gray code order
- Optimal canonization of all substrings of a string
- Optimal algorithms for computing the canonical form of a circular string
- Quantum algorithm for lexicographically minimal string rotation
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- Canonical representations of partial 2- and 3-trees
- Description and analysis of a bottom-up DFA minimization algorithm
- Linear computation of unbordered conjugate on unordered alphabet
- Linear time algorithm for the conjugacy problem in the first Grigorchuk group
- Finding the cyclic covers of a string
- Constructing the first (and coolest) fixed-content universal cycle
- Computation of maximal determinants of binary circulant matrices
- A simple shift rule for \(k\)-ary de Bruijn sequences
- A theory of ultimately periodic languages and automata with an application to time granularity
- Sorting strings and constructing digital search trees in parallel
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- On the language of primitive words
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- Polynomial-delay generation of functional digraphs up to isomorphism
- Ranking and unranking fixed-density necklaces and Lyndon words
- Canonical representations of partial 2-and 3-trees
- Near-optimal quantum algorithms for string problems
- A fast average case algorithm for lyndon decomposition
- Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
- Two-way machines and de Bruijn words
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R
- An efficient parallel algorithm for the single function coarsest partition problem
- Average cost of Duval's algorithm for generating Lyndon words
- Fast detection and display of symmetry in outerplanar graphs
- Efficient universal cycle constructions for weak orders
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- A surprisingly simple de Bruijn sequence construction
- The alternating BWT: an algorithmic perspective
- A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications
- A linear time solution to the single function coarsest partition problem
- A constant-time algorithm for middle levels Gray codes
- Circle graph isomorphism in almost linear time
- A framework for constructing de Bruijn sequences via simple successor rules
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
This page was built for publication: Lexicographically least circular substrings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144948)
