The following pages link to Inge Li Gørtz (Q294945):
Displayed 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)
- Matching subsequences in trees (Q1026243) (← links)
- Strong normalization from weak normalization by translation into the lambda-I-calculus (Q1426886) (← 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)
- Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693) (← links)
- Fast arc-annotated subsequence matching in linear space (Q2428660) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Asymmetry in \(k\)-center variants (Q2503348) (← links)
- Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
- Gapped indexing for consecutive occurrences (Q2696274) (← links)
- Compressed Data Structures for Range Searching (Q2799208) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- Stochastic Vehicle Routing with Recourse (Q2843266) (← links)
- Longest Common Extensions via Fingerprinting (Q2890185) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← 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)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Substring Range Reporting (Q3011863) (← links)
- (Q3046473) (← links)
- Locating Depots for Capacitated Vehicle Routing (Q3088097) (← 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)
- Hardness of Preemptive Finite Capacity Dial-a-Ride (Q3595392) (← links)
- Minimum Makespan Multi-vehicle Dial-a-Ride (Q3639273) (← links)
- (Q4598274) (← links)
- (Q4636500) (← links)
- (Q4636584) (← links)
- Locating depots for capacitated vehicle routing (Q4642406) (← links)
- Compact q-Gram Profiling of Compressed Strings (Q4928561) (← links)
- Union-Find with Constant Time Deletions (Q4962164) (← links)
- Sparse Text Indexing in Small Space (Q4962616) (← links)