Divide-and-conquer algorithms on the hypercube

DOI10.1016/0304-3975(96)00033-3zbMath0877.68054OpenAlexW1974258911MaRDI QIDQ1365934

Ralph Werchner, Ernst W. Mayr

Publication date: 10 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00033-3

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal routing of parentheses on the hypercube
• Pipelined parallel prefix computations, and sorting on a pipelined hypercube
• PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms
• Ultracomputers
• Parallel permutation and sorting algorithms and a new generalized connection network
• Parallel Algorithms to Set Up the Benes Permutation Network
• Parallelism in random access machines

This page was built for publication: Divide-and-conquer algorithms on the hypercube