An efficient permutation-based parallel algorithm for range-join in hypercubes

From MaRDI portal

Revision as of 14:13, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1907155

Jump to:navigation, search

DOI10.1016/0167-8191(94)00069-MzbMath0841.68058WikidataQ126975385 ScholiaQ126975385MaRDI QIDQ1907155

Publication date: 29 January 1996

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

hypercubes time complexity parallel range-join algorithm

Mathematics Subject Classification ID

Computer system organization (68M99) Distributed algorithms (68W15)

This page was built for publication: An efficient permutation-based parallel algorithm for range-join in hypercubes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1907155&oldid=14323430"