3 papers
cs.DS2026
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…
cs.DS2026
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…
cs.DS2025
Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries
Seungbum Jo, Geunho Kim
Given an array of size from a total order, we consider the problem of constructing a data structure that supports various queries (range minimum/maximum queries with their vari…