Parallel random access machines with bounded memory wordsize (Q757038): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: Parallel computation and conflicts in memory access / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast parallel algorithm for routing in permutation networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Parallel Searching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simulation of Parallel Random Access Machines by Circuits / rank | |||
Normal rank | |||
Latest revision as of 15:24, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel random access machines with bounded memory wordsize |
scientific article |
Statements
Parallel random access machines with bounded memory wordsize (English)
0 references
1991
0 references
parallel random access machines
0 references
parallel computation
0 references
incomparability
0 references
infinitely many memory cells
0 references
hierarchy of machine classes
0 references
wordsize
0 references
boolean circuits
0 references
0 references
