Pages that link to "Item:Q4302816"
From MaRDI portal
The following pages link to A Four Russians algorithm for regular expression pattern matching (Q4302816):
Displaying 29 items.
- String matching with variable length gaps (Q442239) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- Fast searching in packed strings (Q533408) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- A faster algorithm for finding shortest substring matches of a regular expression (Q1711433) (← links)
- Exact matching of RNA secondary structure patterns (Q1781989) (← links)
- Regular expression searching on compressed text (Q1827268) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- On the size of partial derivatives and the word membership problem (Q2041687) (← links)
- From regular expression matching to parsing (Q2089747) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Dictionary matching with a few gaps (Q2346375) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Mind the gap! (Q2414857) (← links)
- Faster Algorithms for Weighted Recursive State Machines (Q2988644) (← links)
- Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism (Q3000495) (← links)
- Compressing Regular Expressions’ DFA Table by Matrix Decomposition (Q3073647) (← links)
- Dynamic Set Intersection (Q3449844) (← links)
- Fast Searching in Packed Strings (Q3637108) (← links)
- Minimized Thompson NFA (Q4823348) (← links)
- (Q5002674) (← links)
- (Q5090981) (← links)
- From Regular Expression Matching to Parsing (Q5092434) (← links)
- (Q5140776) (← links)
- Space-Efficient Representations for Glushkov Automata (Q5384522) (← links)
- (Q5874553) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
