scientific article; zbMATH DE number 176779

zbMATH Open0769.68107MaRDI QIDQ4036609FDOQ4036609

Authors: Moni Naor 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Faster Parallel String Matching via Larger Deterministic Samples
• String matching in Lempel-Ziv compressed strings
• scientific article; zbMATH DE number 3911754
• scientific article; zbMATH DE number 1263249
• Optimal parallel pattern matching in strings

zbMATH Keywords

on-line algorithmsstring matchingpreprocessingLempel Ziv algorithmparallel data compression

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Combinatorics on words (68R15) Distributed algorithms (68W15)

Cited In (6)

• String matching with lookahead
• Parallelism and dictionary based data compression
• On the decisional complexity of problems over the reals
• Adaptive learning of compressible strings
• New advances in rightmost Lempel-Ziv
• Sublinear time Lempel-Ziv (LZ77) factorization

This page was built for publication:

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