Pages that link to "Item:Q1144948"

The following pages link to Lexicographically least circular substrings (Q1144948):

Displaying 40 items.

• Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
• A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
• A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
• A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
• Efficient universal cycle constructions for weak orders (Q785821) (← links)
• A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
• An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
• Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
• A linear time solution to the single function coarsest partition problem (Q1063420) (← links)
• Optimal canonization of all substrings of a string (Q1183603) (← links)
• Optimal algorithms for computing the canonical form of a circular string (Q1190455) (← links)
• Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
• Fast detection and display of symmetry in outerplanar graphs (Q1199463) (← links)
• An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
• Average cost of Duval's algorithm for generating Lyndon words (Q1334678) (← links)
• On the language of primitive words (Q1351946) (← links)
• Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← links)
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) (← links)
• A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
• Ranking and unranking fixed-density necklaces and Lyndon words (Q2272399) (← links)
• An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
• The alternating BWT: an algorithmic perspective (Q2297865) (← links)
• A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
• Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
• Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns (Q2980895) (← links)
• A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
• Computation of Maximal Determinants of Binary Circulant Matrices (Q4568052) (← links)
• A fast average case algorithm for lyndon decomposition (Q4876360) (← links)
• Linear time algorithm for the conjugacy problem in the first Grigorchuk group (Q5002196) (← links)
• Canonical representations of partial 2-and 3-trees (Q5056113) (← links)
• On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
• A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications (Q5140773) (← links)
• Indexing Circular Patterns (Q5452151) (← links)
• Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
• Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
• Near-optimal quantum algorithms for string problems (Q6174814) (← links)
• Polynomial-delay generation of functional digraphs up to isomorphism (Q6611003) (← links)