Searching for "An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String
by Alberto Apostolico, Alberto Apostolico, Dany Breslauer, Dany Breslauer — 1995
… O(log log n) Time Parallel Algorithm for Detecting all Squares in a String Alberto Apostolico y…
Cited by 9 (6 self) – Add To MetaCart

Automata to Logic - and
by Back January Pp, Gudmund Skovbjerg Fr, Thore Husfeldt, Peter Bro Miltersen
… O(log log n) Time Parallel Algorithm for Detecting all Squares in a String. February 1995. 18 pp…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB