✦ LIBER ✦

O(1)-time parallel string-matching algorithm with VLDCs

✍ Scribed by Kuo-Liang Chung

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 301 KB
Volume: 17
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(96)00007-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(1) time algorithm for generating Fi

An O(1) time algorithm for generating Fibonacci strings

✍ Kenji Mikawa; Ichiro Semba 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB

Parallel Algorithms for Dynamic Programm

Parallel Algorithms for Dynamic Programming Recurrences with More Than O(1) Dependency

✍ Z. Galil; K. Park 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 716 KB

Optimal Compile-Time Multiprocessor Sche

Optimal Compile-Time Multiprocessor Scheduling Based on the O–1 Linear Programming Algorithm with the Branch and Bound Technique

✍ D.Antony Louis Piriyakumar; C.Siva Ram Murthy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 238 KB

This paper is organized as follows. We describe the formulation of the problem and the required definitions in Section II. In Section III, the performance improvement over [6] due to processor isomorphism and look ahead pruning in reducing the search space is explained, along with a note on the lowe