On the time required to sum n semigroup elements on a parallel machine with simultaneous writes (Q1101213): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal interconnection pattern for parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3746885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3746884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank
 
Normal rank

Latest revision as of 16:53, 18 June 2024

scientific article
Language Label Description Also known as
English
On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
scientific article

    Statements

    On the time required to sum n semigroup elements on a parallel machine with simultaneous writes (English)
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    completely-connected network of random-access machines
    0 references
    semigroup summation problem
    0 references
    upper bounds
    0 references
    lower bounds
    0 references
    0 references