Pages that link to "Item:Q5307519"
From MaRDI portal
The following pages link to Sublinear Algorithms for Parameterized Matching (Q5307519):
Displaying 14 items.
- Parameterized searching with mismatches for run-length encoded strings (Q714802) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- Parameterized matching with mismatches (Q924551) (← links)
- Parameterized matching on non-linear structures (Q989510) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- Parameterized pattern matching: Algorithms and applications (Q1915502) (← links)
- A taxonomy of sublinear multiple keyword pattern matching algorithms (Q1924627) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Algorithms – ESA 2004 (Q5464599) (← links)
- Combinatorial Pattern Matching (Q5713549) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)