SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗ (Q4820034): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1080/10637199408915455 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2078131483 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3805925 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bitonic Sort on a Mesh-Connected Parallel Computer / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mesh-Connected Computers with Broadcasting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sorting on a mesh-connected parallel computer / rank | |||
Normal rank |
Latest revision as of 14:29, 7 June 2024
scientific article; zbMATH DE number 2106645
Language | Label | Description | Also known as |
---|---|---|---|
English | SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗ |
scientific article; zbMATH DE number 2106645 |
Statements
SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗ (English)
0 references
6 October 2004
0 references
0 references