✦ LIBER ✦

An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm

✍ Scribed by Breslauer, Dany; Galil, Zvi

Book ID: 118176845
Publisher: Society for Industrial and Applied Mathematics
Year: 1990
Tongue: English
Weight: 960 KB
Volume: 19
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0219072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log n log log n) parallel maximum

An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

✍ Taenam Kim; Kyung-Yong Chwa 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Optimal parallel selection has complexit

Optimal parallel selection has complexity O(Log Log N)

✍ Miklós Ajtai; János Komlós; W.L. Steiger; Endre Szemerédi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 503 KB

An O(n2log n) parallel max-flow algorith

An O(n2log n) parallel max-flow algorithm

✍ Yossi Shiloach; Uzi Vishkin 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 966 KB

An O(n log n) algorithm for finding diss

An O(n log n) algorithm for finding dissimilar strings

✍ Sarmad Abbasi; Anirvan Sengupta 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Let P be a finite alphabet and x E Z'. A string y E Zm is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an 0( n log n) algorithm which on input x E 2? and an integer m < n outputs an integer k and y E .Zm such that: (1) y is k-dissimi

Erratum: An $O(n\log \log n)$-Time Algor

Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

✍ Tarjan, Robert E.; Van Wyk, Christopher J. 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 60 KB

An O(n log n) algorithm for the convex b

An O(n log n) algorithm for the convex bipartite matching problem

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB