A simple randomized parallel algorithm for list-ranking (Q911268): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(90)90196-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034924661 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q30051916 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank | |||
Normal rank | |||
Latest revision as of 14:06, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple randomized parallel algorithm for list-ranking |
scientific article |
Statements
A simple randomized parallel algorithm for list-ranking (English)
0 references
1990
0 references
parallel processing
0 references
analysis of algorithms
0 references
EREW PRAM
0 references
