The following pages link to Dominik Kempa (Q405572):
Displaying 30 items.
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os (Q1796848) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- Tighter Bounds for the Sum of Irreducible LCP Values (Q2942269) (← links)
- Parallel External Memory Suffix Sorting (Q2942270) (← links)
- Faster Sparse Suffix Sorting (Q2965500) (← links)
- Diverse Palindromic Factorization Is NP-complete (Q3451091) (← links)
- Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet (Q4580166) (← links)
- Faster External Memory LCP Array Construction (Q4606333) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- (Q4636645) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small (Q4928572) (← links)
- (Q5009616) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- String Range Matching (Q5165609) (← links)
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure (Q5212816) (← links)
- At the roots of dictionary compression: string attractors (Q5230341) (← links)
- Lempel-Ziv Factorization: Simple, Fast, Practical (Q5232451) (← links)
- Engineering External Memory Induced Suffix Sorting (Q5232567) (← links)
- Hybrid Indexing Revisited (Q5232716) (← links)
- Optimal Construction of Compressed Indexes for Highly Repetitive Texts (Q5236266) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
- (Q6075948) (← links)
- Breaking the \(\mathcal{O}(n)\)-barrier in the construction of compressed suffix arrays and suffix trees (Q6538718) (← links)
- An upper bound and linear-space queries on the LZ-End parsing (Q6575186) (← links)
- Grammar boosting: a new technique for proving lower bounds for computation over compressed data (Q6645484) (← links)
