Observations on optimal parallelizations of two-list algorithm (Q991072): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.parco.2009.09.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035943313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel two-list algorithm for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on parallel algorithms for the knapsack problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:20, 3 July 2024

scientific article
Language Label Description Also known as
English
Observations on optimal parallelizations of two-list algorithm
scientific article

    Statements

    Observations on optimal parallelizations of two-list algorithm (English)
    0 references
    2 September 2010
    0 references
    knapsack problem
    0 references
    subset-sum problem
    0 references
    parallel algorithm
    0 references
    two-list algorithm
    0 references

    Identifiers