Computing primitively-rooted squares and runs in partial words
From MaRDI portal
Publication:2946044
DOI10.1007/978-3-319-19315-1_8zbMATH Open1380.68319OpenAlexW943816513MaRDI QIDQ2946044FDOQ2946044
Authors: Jordan Nikkel, J. D. Quigley, Xufan Zhang, F. Blanchet-Sadri 
Publication date: 15 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_8
Recommendations
Cites Work
- Title not available (Why is that?)
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- Repetitions in strings: algorithms and combinatorics
- An O(n log n) algorithm for finding all repetitions in a string
- Generalized String Matching
- Algorithms on Strings
- Squares in partial words
- Periodicity algorithms for partial words
- Periodicity algorithms and a conjecture on overlaps in partial words
- A Graph Polynomial Approach to Primitivity
- Combinatorial Queries and Updates on Partial Words
- On the number of squares in partial words
Cited In (8)
- Constructing words with high distinct square densities
- Combinatorial Queries and Updates on Partial Words
- Extracting powers and periods in a word from its runs structure
- Squares and primitivity in partial words
- Computing all repeats of a partial word
- Computing primitively-rooted squares and runs in partial words
- Efficient enumeration of non-equivalent squares in partial words with few holes
- Efficient enumeration of non-equivalent squares in partial words with few holes
This page was built for publication: Computing primitively-rooted squares and runs in partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946044)
