SEGID
From MaRDI portal
Cited in
(9)- Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
- MAVG
- On the range maximum-sum segment query problem
- Improved algorithms for the \(k\) maximum-sums problems
- Detecting regular visit patterns
- Cache oblivious algorithms for the RMQ and the RMSQ problems
- Finding a longest nonnegative path in a constant degree tree
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- Optimal algorithms for the average-constrained maximum-sum segment problem
This page was built for software: SEGID
