Efficient parallel k selection algorithm (Q912623): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Parallel Merge Sort / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decentralized extrema-finding in circular configurations of processors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) Unidirectional Algorithm for the Circular Extrema Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Selection of the first k largest processes in hypercubes / rank | |||
Normal rank |
Revision as of 15:31, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient parallel k selection algorithm |
scientific article |
Statements
Efficient parallel k selection algorithm (English)
0 references
1990
0 references
k skeleton
0 references
parallel algorithm
0 references
n-cube network
0 references
0 references