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

From MaRDI portal
Revision as of 11:08, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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