7 papers
Succinct Data Structures for Baxter Permutation and Related Families
Sankardeep Chakraborty, Seungbum Jo, Geunho Kim +1
A permutation is a Baxter permutation if and only if it does not contain either of the patterns and . Baxter permutations are one of the m…
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane +1
We design succinct encodings of {\it series-parallel, block-cactus} and {\it 3-leaf power} graphs while supporting the basic navigational queries such as degree, adjacency and neig…
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo +3
We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency, and neighborhood…
Succinct Data Structures for Families of Interval Graphs
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo +1
We consider the problem of designing succinct data structures for interval graphs with vertices while supporting degree, adjacency, neighborhood and shortest path queries in op…
Compressed Range Minimum Queries
Paweł Gawrychowski, Seungbum Jo, Shay Mozes +1
Given a string of integers in , a range minimum query RMQ asks for the index of the smallest integer in . It is well known that the problem can…
Approximate Query Processing over Static Sets and Sliding Windows
Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti +1
Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we…