Lexicographically least circular substrings
From MaRDI portal
Cites work
Cited in
(54)- A linear time solution to the single function coarsest partition problem
- Optimal canonization of all substrings of a string
- Optimal algorithms for computing the canonical form of a circular string
- Canonical representations of partial 2- and 3-trees
- Fast detection and display of symmetry in outerplanar graphs
- An efficient parallel algorithm for the single function coarsest partition problem
- Average cost of Duval's algorithm for generating Lyndon words
- On the language of primitive words
- Sorting strings and constructing digital search trees in parallel
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- 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
- Ranking and unranking fixed-density necklaces and Lyndon words
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- The alternating BWT: an algorithmic perspective
- A constant-time algorithm for middle levels Gray codes
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- Flip-swap languages in binary reflected Gray code order
- Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- Linear computation of unbordered conjugate on unordered alphabet
- Computation of maximal determinants of binary circulant matrices
- A fast average case algorithm for lyndon decomposition
- Linear time algorithm for the conjugacy problem in the first Grigorchuk group
- A surprisingly simple de Bruijn sequence construction
- Canonical representations of partial 2-and 3-trees
- On a combinatorial generation problem of Knuth
- A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications
- Indexing Circular Patterns
- Finding the cyclic covers of a string
- Constructing the first (and coolest) fixed-content universal cycle
- Circle graph isomorphism in almost linear time
- Quantum algorithm for lexicographically minimal string rotation
- Near-optimal quantum algorithms for string problems
- Two-way machines and de Bruijn words
- Polynomial-delay generation of functional digraphs up to isomorphism
- New successor rules to efficiently produce exponentially many binary de Bruijn sequences
- Sorting circular suffixes in linear time
- Efficient construction of long orientable sequences
- Finding the cyclic covers of a string
- Constructing k-ary orientable sequences with asymptotically optimal length
- Hamiltonicity of Schrijver graphs and stable Kneser graphs
- Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences
- A note on quantum divide and conquer for minimal string rotation
- Efficient constructions of the prefer-same and prefer-opposite de Bruijn sequences
- Simple linear time algorithm for sorting strings in omega-order with applications
- A simple shift rule for \(k\)-ary de Bruijn sequences
- A theory of ultimately periodic languages and automata with an application to time granularity
- Universal cycle constructions for k-subsets and k-multisets
- Efficient universal cycle constructions for weak orders
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R
- Description and analysis of a bottom-up DFA minimization algorithm
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)
