Parallel computation and conflicts in memory access (Q1171382): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Luděk Kučera / rank
Normal rank
 
Property / author
 
Property / author: Luděk Kučera / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Complexity Results for Matrix Computations on Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms in Graph Theory: Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum: A fast stable sorting algorithm with absolutely minimum storage / 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 17:23, 13 June 2024

scientific article
Language Label Description Also known as
English
Parallel computation and conflicts in memory access
scientific article

    Statements

    Parallel computation and conflicts in memory access (English)
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel computation
    0 references
    model of computation
    0 references
    graph algorithms
    0 references
    parallel RAM
    0 references
    parallel time complexity
    0 references
    conflict-resolution rules in an idealized concurrent environment
    0 references
    0 references