✦ LIBER ✦

Efficient CRCW-PRAM algorithms for universal substring searching

✍ Scribed by Alberto Apostolico

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 988 KB
Volume: 108
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90197-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for searching for e

Efficient algorithms for searching for exact repetition of nucleotide sequences

✍ Ruth Nussinov 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 214 KB

Efficient and Scalable PRAM Algorithms f

Efficient and Scalable PRAM Algorithms for Discrete-Event Simulation of Bounded Degree Networks

✍ S. Prasad 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

We describe two new parallel algorithms, one conservative and another optimistic, for discrete-event simulation on an exclusiveread exclusive-write parallel random-access machine (EREW PRAM). The target physical systems are bounded degree networks which are represented by logic circuits. Employing \

An efficient Write-All algorithm for fai

An efficient Write-All algorithm for fail-stop PRAM without initialized memory

✍ Alex A. Shvartsman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 791 KB

An efficient pram algorithm for maximum-

An efficient pram algorithm for maximum-weight independent set on permutation graphs

✍ Anita Saha; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 191 KB

Efficient line search algorithm for unco

Efficient line search algorithm for unconstrained optimization

✍ F. A. Potra; Y. Shi 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 1023 KB

Efficient search algorithms for RNAi tar

Efficient search algorithms for RNAi target detection

✍ Shibin Qiu; Terran Lane; Cundong Yang 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 543 KB