Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0217009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2081385108 / rank | |||
Normal rank |
Latest revision as of 00:06, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time |
scientific article |
Statements
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (English)
0 references
1988
0 references
expander graphs
0 references
optimal speed-up
0 references
scheduling
0 references
approximate reschedulings
0 references
PRAM algorithm
0 references
list ranking
0 references