Skip to main content
Skip to main navigation menu
Skip to site footer
Open Menu
Current
Archives
Announcements
About
About the Journal
Editorial Team
Privacy Statement
Contact
Search
Login
Home
/
Archives
/
No. 11 (1995): RS-11 An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String
No. 11 (1995): RS-11 An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String
Published:
1995-01-11
Articles
An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String
Alberto Apostolico, Dany Breslauer
PDF
Language
Dansk
English
Information
For Readers
For Librarians
Current Issue
