The following pages link to Combinatorial Pattern Matching (Q5315348):
Displaying 17 items.
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- An efficient method to evaluate intersections on big data sets (Q306702) (← links)
- Efficient optimally lazy algorithms for minimal-interval semantics (Q313957) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Fast set intersection and two-patterns matching (Q708235) (← links)
- \(k\)-difference matching in amortized linear time for all the words in a text (Q1006084) (← links)
- A new optimal distributed algorithm for the set intersection problem (Q1178213) (← links)
- A fast algorithm for finding interlocking sets (Q1263973) (← links)
- Intersection reporting on two collections of disjoint sets (Q1818976) (← links)
- Finding and enumerating large intersections (Q2344773) (← links)
- Adaptive searching in succinctly encoded binary relations and tree-structured documents (Q2465061) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Dynamic Set Intersection (Q3449844) (← links)
- Fast Intersection Algorithms for Sorted Sequences (Q3558257) (← links)
- Irredundant Set Faster Than O(2 n ) (Q3563010) (← links)
- Fast Evaluation of Union-Intersection Expressions (Q5387808) (← links)
- Stochastic Algorithms: Foundations and Applications (Q5901977) (← links)
