✦ LIBER ✦

A randomized parallel algorithm for string matching on hypercube

✍ Scribed by Kuo-Liang Chung

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 301 KB
Volume: 25
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(92)90027-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple randomized parallel algorithm f

A simple randomized parallel algorithm for maximal ƒ-matchings

✍ Oscar Garrido; Stefan Jarominek; Andrzej Lingas; Wojciech Rytter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 449 KB

A string-matching algorithm for the CREW

A string-matching algorithm for the CREW PRAM

✍ Nalvo F. de Almeida Jr.; Valmir C. Barbosa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 249 KB

A fast algorithm for string matching wit

A fast algorithm for string matching with mismatches

✍ A Dermouche 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Design of parallel algorithms for a dist

Design of parallel algorithms for a distributed memory hypercube

✍ EL Zapata; OG Plata; FF Rivera 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 852 KB

A Randomized Parallel Algorithm for Plan

A Randomized Parallel Algorithm for Planar Graph Isomorphism

✍ Hillel Gazit; John H Reif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ž Ž 2 . 1 q ⑀ which can be computed by known algorithms in O log n time with

A simple randomized parallel algorithm f

A simple randomized parallel algorithm for list-ranking

✍ Richard J. Anderson; Gary L. Miller 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 506 KB