@inproceedings{992a7f35c41c489db34f55d2e1c68625,
title = "Optimal routing of parentheses on the hypercube",
abstract = "We consider a new class of routing requests or partial permutations for which we give optimal on-line routing algorithms on the hypercube and shuffle-exchange network. For well-formed words of parentheses our algorithm establishes communication between all matching pairs in logarithmic time. It can be applied to the membership problem for Dyck languages and a number of problems for algebraic expressions.",
author = "Mayr, \{Ernst W.\} and Ralph Werchner",
year = "1992",
doi = "10.1145/140901.140913",
language = "English",
isbn = "089791483X",
series = "4th Annual ACM Symposium on Parallel Algorithms and Architectures",
publisher = "Publ by ACM",
pages = "109--117",
booktitle = "4th Annual ACM Symposium on Parallel Algorithms and Architectures",
note = "4th Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA '92 ; Conference date: 29-06-1992 Through 01-07-1992",
}