research
∙
08/31/2022
Space-efficient data structure for next/previous larger/smaller value queries
Given an array of size n from a total order, we consider the problem of ...
share
research
∙
08/24/2021
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs
We design succinct encodings of series-parallel, block-cactus and 3-leaf...
research
∙
10/09/2020
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
We consider the problem of designing succinct navigational oracles, i.e....
research
∙
02/25/2019
Succinct Data Structures for Families of Interval Graphs
We consider the problem of designing succinct data structures for interv...
research
∙
02/12/2019
Compressed Range Minimum Queries
Given a string S of n integers in [0,σ), a range minimum query RMQ(i, j)...
research
∙
09/19/2018
Encoding two-dimensional range top-k queries revisited
We consider the problem of encoding two-dimensional arrays, whose elemen...
research
∙
09/14/2018
Approximate Query Processing over Static Sets and Sliding Windows
Indexing of static and dynamic sets is fundamental to a large set of app...
research
∙
12/09/2017
