--- _id: '19850' author: - first_name: Rolf full_name: Wanka, Rolf last_name: Wanka citation: ama: 'Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG). Berlin, Heidelberg; 2002:413-420. doi:10.1007/3-540-36379-3_36' apa: Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG) (pp. 413–420). Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_36 bibtex: '@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}, DOI={10.1007/3-540-36379-3_36}, booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, author={Wanka, Rolf}, year={2002}, pages={413–420} }' chicago: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 413–20. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-36379-3_36. ieee: R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal,” in Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–420. mla: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36. short: 'R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Heidelberg, 2002, pp. 413–420.' date_created: 2020-10-02T11:16:31Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/3-540-36379-3_36 language: - iso: eng page: 413-420 place: Berlin, Heidelberg publication: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG) publication_identifier: isbn: - '9783540003311' - '9783540363798' issn: - 0302-9743 publication_status: published status: public title: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal type: conference user_id: '15415' year: '2002' ...