Encodings of Range Maximum-Sum Segment Queries and Applications

DOI10.1007/978-3-319-19929-0_17zbMath1432.68090arXiv1410.2847OpenAlexW2112390795MaRDI QIDQ2942257

Paweł Gawrychowski, Patrick K. Nicholson

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.2847

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (4)

Encoding two-dimensional range top-\(k\) queries ⋮ Encodings of Range Maximum-Sum Segment Queries and Applications ⋮ Unnamed Item ⋮ An Encoding for Order-Preserving Matching.

Cites Work

• Unnamed Item
• Unnamed Item
• A simple optimal representation for balanced parentheses
• Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
• Time bounds for selection
• A simple linear-space data structure for constant-time range minimum query
• On the range maximum-sum segment query problem
• Succinct Representation of Balanced Parentheses and Static Trees
• Array Range Queries
• Encodings of Range Maximum-Sum Segment Queries and Applications
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Computing Maximum-Scoring Segments in Almost Linear Time
• Spaces, Trees, and Colors

This page was built for publication: Encodings of Range Maximum-Sum Segment Queries and Applications