![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Optimal Multicast Tree Routing for Cluster Computing in Hypercube Interconnection Networks."
@article{DBLP:journals/ieicet/JiaHAHZ04, author = {Weijia Jia and Bo Han and Pui{-}on Au and Yong He and Wanlei Zhou}, title = {Optimal Multicast Tree Routing for Cluster Computing in Hypercube Interconnection Networks}, journal = {{IEICE} Trans. Inf. Syst.}, volume = {87-D}, number = {7}, pages = {1625--1632}, year = {2004}, url = {http://search.ieice.org/bin/summary.php?id=e87-d\_7\_1625}, timestamp = {Fri, 22 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ieicet/JiaHAHZ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ispan/JiaAHZ02, author = {Weijia Jia and Pui{-}on Au and Yong He and Wanlei Zhou}, title = {Optimal Multicast Tree Routing for Cluster Computing in Hypercube Interconnection Networks}, booktitle = {International Symposium on Parallel Architectures, Algorithms and Networks, {ISPAN} 2002, May 22-24, 2002, Makati City, Metro Manila, Philippines}, pages = {295--300}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/ISPAN.2002.1004297}, doi = {10.1109/ISPAN.2002.1004297}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ispan/JiaAHZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.