Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes (Q3719831): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Stephen A. Cook / rank
Normal rank
 
Property / author
 
Property / author: K. Ruediger Reischuk / rank
Normal rank
 
Property / author
 
Property / author: Stephen A. Cook / rank
 
Normal rank
Property / author
 
Property / author: K. Ruediger Reischuk / 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.1137/0215006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070570981 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:03, 19 March 2024

scientific article
Language Label Description Also known as
English
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
scientific article

    Statements

    Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    parallel computation
    0 references
    time lower bounds
    0 references
    synchronous parallel computer
    0 references
    sorting
    0 references

    Identifiers

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