𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Space efficient search for maximal repetitions

✍ Scribed by Leszek Ga¸sieniec; Roman Kolpakov; Igor Potapov

Book ID
108281042
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
238 KB
Volume
339
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time-efficient state space search
Time-efficient state space search
✍ Alexander Reinefeld; Peter Ridinger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 628 KB

We present two time-efficient state space algorithms for searching minimax trees. Because they are based on SSS\* and Dual\*, both dominate Alpha-Beta on a node count basis. Moreover, one of them is always faster in searching random trees, even when the leaf node evaluation time is negligible. The f

Optimal Parallel Searching an Array for
Optimal Parallel Searching an Array for Certain Repetitions
✍ Valentin E. Brimkov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Repetitive substructures of two-dimensional arrays have been recently defined and studied in an attempt to parallel some of the analogous developments already known for strings. In the present paper we propose an O(log log n) time O(n 3 log n) work optimally fast, optimal parallel CRCW-PRAM algorith