String search in coarse-grained parallel computers

DOI10.1007/PL00008259MaRDI QIDQ1125800zbMATH OpenOpenAlexFDO

Authors Fabrizio Luccio, Paolo Ferragina

Publication date 3 January 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00008259

zbMATH Keywords

multistring search problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 3911754
• Optimal parallel pattern matching in strings
• Faster Parallel String Matching via Larger Deterministic Samples
• Efficient parallel string comparison

Cited in

(4)

• Efficient coarse grained data distributions and string pattern matching
• Coarse grained gather and scatter operations with applications
• Pipelined search on coarse grained networks
• Engineering a textbook approach to index massive string dictionaries

This page was built for publication: String search in coarse-grained parallel computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1125800)