Optimal parallel construction of prescribed tournaments (Q2641314): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3856672 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4099676 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818315 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5514188 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585195 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Algorithms for Zero-One Supply-Demand Problems / rank | |||
Normal rank | |||
Revision as of 14:53, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal parallel construction of prescribed tournaments |
scientific article |
Statements
Optimal parallel construction of prescribed tournaments (English)
0 references
1990
0 references
The author presents an algorithm that constructs a tournament \(T_ n\) having a specified score list in time O(log n) using \(O(n^ 2/\log n)\) processors.
0 references
construction
0 references
tournament
0 references
score list
0 references
