A fast average case algorithm for lyndon decomposition
From MaRDI portal
Recommendations
- An Average-Case Sublinear Exact Li and Stephens Forward Algorithm
- Average case complexity of linear multivariate problems
- Fast parallel Lyndon factorization with applications
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- A survey of average case complexity for linear multivariate problems
- Average case complexity of linear multivariate problems. II: Applications
- scientific article; zbMATH DE number 88944
- Average case complexity of linear multivariate problems. I: Theory
- An efficient decomposition method for linear programming problems
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- An improved algorithm to check for polygon similarity
- Factorizing words over an ordered alphabet
- Fast Pattern Matching in Strings
- Fast canonization of circular strings
- Lexicographically least circular substrings
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
Cited in
(7)- Optimal canonization of all substrings of a string
- Quantum algorithm for lexicographically minimal string rotation
- A note on quantum divide and conquer for minimal string rotation
- An Average-Case Sublinear Exact Li and Stephens Forward Algorithm
- scientific article; zbMATH DE number 1948508 (Why is no real title available?)
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
- Fast parallel Lyndon factorization with applications
This page was built for publication: A fast average case algorithm for lyndon decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876360)
