Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal routing of parentheses on the hypercube

From MaRDI portal
Publication:1893667
Jump to:navigation, search

DOI10.1006/jpdc.1995.1058zbMath0939.68514OpenAlexW2042603621MaRDI QIDQ1893667

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)


Related Items (1)

Divide-and-conquer algorithms on the hypercube






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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1893667&oldid=14305061"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 13:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki