A parallel algorithm for generating combinations (Q1825043): 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/0898-1221(89)90052-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060958954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating combinations in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel generation of permutations and combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:08, 20 June 2024

scientific article
Language Label Description Also known as
English
A parallel algorithm for generating combinations
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references