✦ LIBER ✦

Parallel processing of encoded bit strings

✍ Scribed by Angela Y. Wu; Azriel Rosenfeld

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 547 KB
Volume: 21
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(88)90029-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edit distance of run-length encoded stri

Edit distance of run-length encoded strings

✍ Ora Arbell; Gad M. Landau; Joseph S.B. Mitchell 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l + |Y |k) time algorithm that computes their edit distance.

An associative string processor architec

An associative string processor architecture for parallel processing applications

✍ A Krikelis; R.M Lea 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 856 KB

On parallelism of strings in tangles

✍ Chuichiro Hayashi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 758 KB

Bit-strings and other modifications of V

Bit-strings and other modifications of Viviane model for language competition

✍ P.M.C. de Oliveira; D. Stauffer; F.W.S. Lima; A.O. Sousa; C. Schulze; S. Moss de 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 505 KB

The language competition model of Viviane de Oliveira et al. is modified by associating with each language a string of 32 bits. Whenever a language changes in this Viviane model, also one randomly selected bit is flipped. If then only languages with different bit-strings are counted as different, th

Overview of parallel processing

✍ G.S Almasi 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Derivation of a parallel string matching

Derivation of a parallel string matching algorithm

✍ Jayadev Misra 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 67 KB

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths.