Constructing sorting networks from k-sorters (Q582119): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68N25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4130040 / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel processing
Property / zbMATH Keywords: parallel processing / rank
 
Normal rank
Property / zbMATH Keywords
 
analysis of algorithms
Property / zbMATH Keywords: analysis of algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
merging networks
Property / zbMATH Keywords: merging networks / 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/0020-0190(89)90196-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968119892 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q38772864 / 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: Improved Divide/Sort/Merge Sorting Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on the Complexity of Parallel Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel sorting scheme whose basic operation sortsN elements / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:12, 20 June 2024

scientific article
Language Label Description Also known as
English
Constructing sorting networks from k-sorters
scientific article

    Statements

    Constructing sorting networks from k-sorters (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel processing
    0 references
    analysis of algorithms
    0 references
    merging networks
    0 references
    0 references
    0 references