107 citations · 409 across the 18 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023★ 19 cited
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
Dominik Kempa, Tomasz Kociumaka
In the last decades, the necessity to process massive amounts of textual data fueled the development of compressed text indexes: data structures efficiently answering queries on a…
cs.DS2023★ 2 cited
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data
Rajat De, Dominik Kempa
Grammar compression is a general compression framework in which a string of length is represented as a context-free grammar of size whose language contains only . In…