A Linear Time Algorithm for the k Maximal Sums Problem

by Gerth Stølting Brodal , Allan Grønlund Jørgensen
Citations:6 - 2 self

Active Bibliography

Queries and Fault Tolerance – Allan Grønlund Jørgensen, Phd Dissertation, Allan Grønlund Jørgensen
Sequential and parallel . . . – Sung Eun Bae - 2007
1 Selecting Sums in Arrays – Gerth Stølting Brodal, Allan Grønlund Jørgensen
2 Algorithms for Finding the Weight-Constrained k Longest Paths in a Tree and the Length-Constrained k Maximum-Sum Segments of a Sequence – Hsiao-fei Liu, Kun-mao Chao - 2008
Contents lists available at ScienceDirect Information Processing Letters – unknown authors
1 Ranking Cartesian Sums and K-maximum subarrays – Sung Eun Bae, Tadao Takaoka - 2006
1 A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem – Sung Eun Bae, Tadao Takaoka
15 Improved algorithms for the k-maximum subarray problem for small k – Sung E. Bae, Tadao Takaoka - 2005
3 Computing maximum-scoring segments in almost linear time – Fredrik Bengtsson, Fredrik Bengtsson, Jingsen Chen, Jingsen Chen - 2006
On – Asish Mukhopadhyay, Eugene Greene
On – Asish Mukhopadhyay, Eugene Greene
3 A note on ranking k maximum sums – Fredrik Sweden Bengtsson, Fredrik Bengtsson, Fredrik Bengtsson, Jingsen Chen, Jingsen Chen, Jingsen Chen
External Examiner Supervisor – Mohammed Thaher
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
The 25th Workshop on Combinatorial Mathematics and Computation Theory Constrained Minkowski Sum Selection and Finding – Cheng-wei Luo, Peng-an Chen, Hsiao-fei Liu
Algorithms for Locating Constrained Optimal Intervals ∗ – Hsiao-fei Liu, Peng-an Chen, Kun-mao Chao - 2008
5 An O(n 3 log log n / log n) Time Algorithm for the All-Pairs Shortest Path Problem – Tadao Takaoka - 2004
9 Portable Distributed Priority Queues with MPI – Bernard Mans, North Queensland - 1995