scientific article

From MaRDI portal
Revision as of 14:38, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3805925

zbMath0657.68070MaRDI QIDQ3805925

Selim G. Akl

Publication date: 1985


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parallel computationparallel algorithmsparallel sorting


Mathematics Subject Classification ID

Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of software (68N99)


Related Items (18)

AN EFFICIENT PARALLEL SORTING COMPATIBLE WITH THE STANDARD QSORT ⋮ Routing on trees via matchings ⋮ Bit serial addition trees and their applications ⋮ An optimal parallel algorithm for sparse matrix bandwidth reduction on a linear array ⋮ SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗ ⋮ Unnamed Item ⋮ Many-to-many routing on trees via matchings ⋮ Unnamed Item ⋮ A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors ⋮ LINEAR LAYOUT OF GENERALIZED HYPERCUBES ⋮ Sorting on Single-Channel Wireless Sensor Networks ⋮ Parallel Sorting for GPUs ⋮ Parallel merging with restriction ⋮ Parallel ART for image reconstruction in CT using processor arrays ⋮ On-line matching routing on trees ⋮ A time-space optimal parallel sorting on a hypercube ⋮ From Parallelism to Nonuniversality: An Unconventional Trajectory ⋮ Parallel comparison merging of many-ordered lists







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3805925&oldid=17379502"
Powered by MediaWiki