1 citations · 1 across the 10 of their papers we have counts for
4 papers · 1 filter
Optimal Labeling Schemes for -Free Matrices
Sankardeep Chakraborty, Seungbum Jo
We study labeling schemes for -free binary matrices, which do not contain a submatrix of the form . We give a label…
Succinct Representation of Search Trees on Trees
Seungbum Jo, Nodari Sitchinava
A search tree on trees (STT) is a data structure for performing a search for a target vertex in a reference tree. A standard binary search tree is a special case of an STT, where t…
Indexing Range Maximum-Sum Segment Queries with Offsets
Seungbum Jo, Dominik Köppl
Given an array of real numbers, the maximum segment sum (MSS) problem is to find a contiguous subarray that has the largest sum. While the MSS problem can be solved optimally w…
Encodings for Range Minimum Queries over Bounded Alphabets
Seungbum Jo, Srinivasa Rao Satti
Range minimum queries (RMQs) are fundamental operations with widespread applications in database management, text indexing and computational biology. While many space-efficient dat…