Computer Science
Data Structure
100%
Pattern Matching
28%
Compression Scheme
22%
Random Access
19%
String Pattern
16%
Vehicle Routing
15%
Wildcard
12%
Parsing
11%
Regular Expression
11%
Intersection Set
11%
Approximation Algorithms
10%
Reference String
9%
Sliding Window
9%
Context-Free Grammars
8%
Constant Factor
8%
Approximate String Matching
8%
Solution Space
8%
Automaton
6%
Longest Path
6%
Preprocessing Time
6%
Production Rule
6%
Clustering Technique
6%
Minimal Distance
6%
Approximation (Algorithm)
5%
Keyphrases
Query Response Time
27%
String Indexing
25%
Linear Space
17%
Consecutive Occurrences
12%
Compact Data Structures
9%
Compression System
9%
Top Trees
9%
Tree Compression
9%
Compressed String
9%
Regular Expression Matching
9%
Partial Sums
9%
Substring
8%
Intersection Problem
8%
Longest Common Extension
7%
Wildcard
6%
Set Intersection
6%
Space-time Data
6%
Q-gram
6%
Capacitated Vehicle Routing
6%
Subsequence Matching
6%
Minimum Makespan
6%
Ultra-wide
6%
Tight Bounds
6%
Word RAM Model
6%
Regular Expression Parsing
6%
Lempel-Ziv
6%
Finger Search
6%
Time-space Tradeoff
5%
Subsequence
5%
Mathematics
Data Structure
35%
Linear Space
26%
Main Result
15%
Partial Sum
12%
Matching Problem
11%
Subsequence
11%
Constant Factor
9%
Approximate String Matching
8%
Tradeoff
8%
Linear Time
7%
Nonuniform
7%
Vehicle Routing Problem
7%
Metric Space
6%
Probability Theory
6%
Minimizes
6%
Integer
6%
Open Problem
6%
Worst Case
5%
Edge
5%
Model of Computation
5%
