Optimal Routing of Parentheses on the Hypercube

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 ca...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of parallel and distributed computing 1995-04, Vol.26 (2), p.181-192
Hauptverfasser:	Mayr, E.W., Werchner, R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Programming languages Software Software engineering
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!