Improved sorting networks with O(log N) depth (Q582098): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56337888 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sorting in \(c \log n\) parallel steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Explicit constructions of linear-sized superconcentrators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071451 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Remark on Stirling's Formula / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:12, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved sorting networks with O(log N) depth |
scientific article |
Statements
Improved sorting networks with O(log N) depth (English)
0 references
1990
0 references
comparators
0 references
parallel algorithm
0 references
sortin networks
0 references