Pages that link to "Item:Q2384388"
From MaRDI portal
The following pages link to On the range maximum-sum segment query problem (Q2384388):
Displaying 14 items.
- Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence (Q501652) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- Left-bottom and right-top segments (Q751793) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- Optimal algorithms for the average-constrained maximum-sum segment problem (Q976064) (← links)
- The reverse problem of range query (Q2843927) (← links)
- The Range 1 Query (R1Q) Problem (Q2920450) (← links)
- Encodings of Range Maximum-Sum Segment Queries and Applications (Q2942257) (← links)
- Dynamic Planar Range Maxima Queries (Q3012811) (← links)
- Maximizing Range Sum in External Memory (Q5012499) (← links)
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE (Q5307491) (← links)
- Algorithms and Computation (Q5712120) (← links)
- Shortest longest-path graph orientations (Q6591464) (← links)