Ranking k maximum sums
From MaRDI portal
Publication:884477
DOI10.1016/J.TCS.2007.03.011zbMATH Open1117.68086OpenAlexW2077527465MaRDI QIDQ884477FDOQ884477
Authors: Fredrik Bengtsson, Jingsen Chen 
Publication date: 6 June 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.011
Recommendations
Cites Work
- Title not available (Why is that?)
- Generalized Selection and Ranking: Sorted Matrices
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
- Pattern analysis. Lectures in pattern theory. Vol. II
- A note on a standard strategy for developing loop invariants and loops
- Algorithms and Computation
- Applications of a strategy for designing divide-and-conquer algorithms
- Efficient algorithms for \(k\) maximum sums
- Title not available (Why is that?)
- Computing and Combinatorics
- Ranking \(k\) maximum sums
Cited In (10)
- Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence
- Algorithms and Computation
- Randomized algorithm for the sum selection problem
- Ranking \(k\) maximum sums
- On max-\(k\)-sums
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
- Selecting Sums in Arrays
- Efficient algorithms for \(k\) maximum sums
- A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
This page was built for publication: Ranking \(k\) maximum sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884477)
