Rolf Wanka. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In Ludek Kucera, editor, Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers. Volume 2573 of Lecture Notes in Computer Science, pages 413-420, Springer, 2002. [doi]
@inproceedings{Wanka02,
title = {Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal},
author = {Rolf Wanka},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2573/25730413.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Wanka02},
cites = {0},
citedby = {0},
pages = {413-420},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers},
editor = {Ludek Kucera},
volume = {2573},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-00331-2},
}