The following pages link to Danny Hucke (Q1647672):
Displaying 17 items.
- Sliding window algorithms for regular languages (Q1647673) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- The smallest grammar problem revisited (Q1796825) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Constructing Small Tree Grammars and Small Circuits for Formulas (Q2978536) (← links)
- (Q3304130) (← links)
- Querying Regular Languages over Sliding Windows (Q4636565) (← links)
- (Q4636634) (← links)
- (Q5002813) (← links)
- Entropy Bounds for Grammar-Based Tree Compressors (Q5032600) (← links)
- The Smallest Grammar Problem Revisited (Q5151712) (← links)
- Circuits and Expressions over Finite Semirings (Q5205797) (← links)
- Universal Tree Source Coding Using Grammar-Based Compression (Q5211451) (← links)
- (Q5875566) (← links)
- Derandomization for sliding window algorithms with strict correctness (Q5918353) (← links)
- Derandomization for sliding window algorithms with strict correctness (Q5919686) (← links)
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings (Q6536243) (← links)
