Optimal routing of parentheses on the hypercube

DOI10.1006/JPDC.1995.1058MaRDI QIDQ1893667zbMATH OpenOpenAlexFDO

Authors Ernst W. Mayr, Ralph Werchner

Publication date 20 July 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/97405fdc824e0646db319c4521cd9eb4ba0eed64

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Cited in

(1)

• Divide-and-conquer algorithms on the hypercube

This page was built for publication: Optimal routing of parentheses on the hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893667)