Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes (Q3719831): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:47, 5 February 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
1986
0 references
parallel computation
0 references
time lower bounds
0 references
synchronous parallel computer
0 references
sorting
0 references
