35 citations · 99 across the 47 of their papers we have counts for
3 papers · 1 filter
Succinct Data Structures for Segments
Philip Bille, Inge Li Gørtz, Simon R. Tarnow
We consider succinct data structures for representing a set of horizontal line segments in the plane given in rank space to support \emph{segment access}, \emph{segment selecti…
Differentially Private Substring and Document Counting with Near-Optimal Error
Giulia Bernardini, Philip Bille, Inge Li Gørtz +1
For databases consisting of many text documents, one of the most fundamental data analysis tasks is counting (i) how often a pattern appears as a substring in the database (substri…
Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
Philip Bille, Inge Li Gørtz, Tord Stordalen +1
We consider the dynamic range minimum problem on the ultra-wide word RAM model of computation. This model extends the classic -bit word RAM model with special ultrawords of leng…