Optimal parallel construction of prescribed tournaments (Q2641314): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q656146
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: John W. Moon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90085-q / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132538470 / rank
 
Normal rank

Latest revision as of 09:42, 30 July 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
    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
    0 references
    construction
    0 references
    tournament
    0 references
    score list
    0 references
    0 references
    0 references