The following pages link to (Q4496242):
Displaying 11 items.
- Fast searching in packed strings (Q533408) (← links)
- Pattern matching and membership for hierarchical message sequence charts (Q927396) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- Algorithmics on SLP-compressed strings: a survey (Q2874365) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Fast Searching in Packed Strings (Q3637108) (← links)
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (Q3637217) (← links)
- Dynamic Compressed Strings with Random Access (Q5326587) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900557) (← links)