Fast parallel string prefix-matching (Q674342)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Fast parallel string prefix-matching	scientific article

Statements

scholarly article

0 references

Fast parallel string prefix-matching (English)

0 references

0 references

Theoretical Computer Science

0 references

publication date

28 February 1997

0 references

MaRDI profile type

MaRDI publication profile

0 references

An Alphabet Independent Approach to Two-Dimensional Pattern Matching

0 references

Optimal parallel algorithms for periods, palindromes and squares

0 references

0 references

Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

0 references

The Parallel Evaluation of General Arithmetic Expressions

0 references

Efficient string matching on packed texts

0 references

Testing string superprimitivity in parallel

0 references

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

0 references

A Lower Bound for Parallel String Matching

0 references

Finding all periods and initial palindromes of a string in parallel

0 references

Optimal parallel algorithms for string matching

0 references

0 references

Fast Pattern Matching in Strings

0 references

The equation \(a_ M=b^ Nc^ P\) in a free group

0 references

An O(n log n) algorithm for finding all repetitions in a string

0 references

Finding the maximum, merging, and sorting in a parallel computation model

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0304-3975(94)00177-K

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:674342

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q674342&oldid=34177160"