An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String
DOI:
https://doi.org/10.7146/brics.v2i11.19514Resumé
An optimal O(log log n) time concurrent-read concurrent-write parallelalgorithm for detecting all squares in a string is presented. A tight
lower bound shows that over general alphabets this is the fastest possible
optimal algorithm. When p processors are available the bounds become
Theta(n log n / p + log log 2p). The algorithm uses an optimal parallel
string-matching algorithm together with periodicity properties to locate
the squares within the input string.
Downloads
Publiceret
1995-01-11
Citation/Eksport
Apostolico, A., & Breslauer, D. (1995). An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String. BRICS Report Series, 2(11). https://doi.org/10.7146/brics.v2i11.19514
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).