Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1186183
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Der-Tsai Lee / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.11.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164079678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for \(k\) maximum sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal slope selection via cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the \(k\) maximum-sums problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal-Time Algorithm for Slope Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a standard strategy for developing loop invariants and loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithm for the sum selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a strategy for designing divide-and-conquer algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250212 / rank
 
Normal rank

Latest revision as of 13:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
scientific article

    Statements

    Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (English)
    0 references
    0 references
    0 references
    9 March 2010
    0 references
    0 references
    \(k\) maximum sums problem
    0 references
    sum selection problem
    0 references
    maximum sum problem
    0 references
    maximum sum subarray problem
    0 references
    0 references