Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries

Authors Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter



PDF
Thumbnail PDF

File

LIPIcs.STACS.2013.245.pdf
  • Filesize: 0.66 MB
  • 12 pages

Document Identifiers

Author Details

Tomasz Kociumaka
Jakub Radoszewski
Wojciech Rytter

Cite AsGet BibTex

Tomasz Kociumaka, Jakub Radoszewski, and Wojciech Rytter. Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 245-256, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.STACS.2013.245

Abstract

We present efficient algorithms computing all Abelian periods of two types in a word. Regular Abelian periods are computed in O(n log log{n}) randomized time which improves over the best previously known algorithm by almost a factor of n. The other algorithm, for full Abelian periods, works in O(n) time. As a tool we develop an O(n) time construction of a data structure that allows O(1) time gcd(i,j) queries for all 1 <= i,j <= n, this is a result of independent interest.
Keywords
  • Abelian period
  • greatest common divisor

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail