The following pages link to Philip Bille (Q294943):
Displaying 50 items.
- Longest common extensions in trees (Q294947) (← links)
- Compact q-gram profiling of compressed strings (Q401308) (← links)
- String matching with variable length gaps (Q442239) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Substring range reporting (Q517792) (← links)
- Fast searching in packed strings (Q533408) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Matching subsequences in trees (Q1026243) (← links)
- A separation between RLSLPs and LZ77 (Q1632509) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Top tree compression of tries (Q2067669) (← links)
- From regular expression matching to parsing (Q2089747) (← links)
- String indexing for top-\(k\) close consecutive occurrences (Q2163391) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Subsequence automata with default transitions (Q2363354) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Fast arc-annotated subsequence matching in linear space (Q2428660) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Gapped indexing for consecutive occurrences (Q2696274) (← links)
- Compressed Data Structures for Range Searching (Q2799208) (← links)
- Longest Common Extensions via Fingerprinting (Q2890185) (← links)
- Fast and Cache-Oblivious Dynamic Programming with Local Dependencies (Q2890186) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Optimal Packed String Matching (Q2911643) (← links)
- Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts (Q2930276) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Substring Range Reporting (Q3011863) (← links)
- The tree inclusion problem (Q3189022) (← links)
- Fast Arc-Annotated Subsequence Matching in Linear Space (Q3401091) (← links)
- Matching Subsequences in Trees (Q3434561) (← links)
- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts (Q3506908) (← links)
- New Algorithms for Regular Expression Matching (Q3613797) (← links)
- Fast Searching in Packed Strings (Q3637108) (← links)
- Faster Regular Expression Matching (Q3638033) (← links)
- (Q4471359) (← links)
- Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation (Q4636500) (← links)
- Finger Search in Grammar-Compressed Strings (Q4636584) (← links)
- Compact q-Gram Profiling of Compressed Strings (Q4928561) (← links)
- Sparse Text Indexing in Small Space (Q4962616) (← links)
- From Regular Expression Matching to Parsing (Q5092434) (← links)
- Deterministic Indexing for Packed Strings (Q5110869) (← links)
- Lempel-Ziv Compression in a Sliding Window (Q5110879) (← links)
- Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing (Q5110880) (← links)
