Towards optimal packed string matching
From MaRDI portal
Publication:2437754
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3608306 (Why is no real title available?)
- scientific article; zbMATH DE number 3633757 (Why is no real title available?)
- scientific article; zbMATH DE number 1263250 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- A Lower Bound for Parallel String Matching
- A constant-time optimal parallel string-matching algorithm
- A fast string searching algorithm
- Accelerating Boyer Moore Searches on Binary Texts
- Algorithms on Strings, Trees and Sequences
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- Approximate String Matching: A Simpler Faster Algorithm
- Constant-Time Randomized Parallel String Matching
- Constant-time word-size string matching
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Efficient string matching
- Factorizing words over an ordered alphabet
- Fast Pattern Matching in Strings
- Fast searching in packed strings
- Faster Parallel String Matching via Larger Deterministic Samples
- Non-standard stringology: algorithms and complexity
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
- Optimal algorithms for computing the canonical form of a circular string
- Optimal canonization of all substrings of a string
- Optimal packed string matching
- Optimal parallel algorithms for string matching
- Optimal parallel pattern matching in strings
- Parallel RAM algorithms for factorizing words
- Parity, circuits, and the polynomial-time hierarchy
- Shift-or string matching with super-alphabets
- Simple real-time constant-space string matching
- String matching under a general matching relation
- The Complexity of Pattern Matching for a Random String
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- The exact online string matching problem: a review of the most recent results
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Transforming comparison model lower bounds to the parallel-random-access-machine
- Two-way string-matching
- Uniqueness Theorems for Periodic Functions
- Worst case efficient single and multiple string matching in the RAM model
Cited in
(11)- Internal pattern matching queries in a text and applications
- Rank and select operations on a word
- Fast convolutions of packed strings and pattern matching with wildcards
- Tighter Packed Bit-Parallel NFA for Approximate String Matching
- Fast and flexible packed string matching
- Fast searching in packed strings
- Fast Packed String Matching for Short Patterns
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Space-efficient Huffman codes revisited
- Fast Searching in Packed Strings
- Optimal packed string matching
This page was built for publication: Towards optimal packed string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437754)
