![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
"Parallel algorithms for computing the smallest binary tree size in unit ..."
Guillermo Aparicio et al. (2018)
- Guillermo Aparicio, Jose M. G. Salmerón, Leocadio G. Casado
, Rafael Asenjo
, Eligius M. T. Hendrix
:
Parallel algorithms for computing the smallest binary tree size in unit simplex refinement. J. Parallel Distributed Comput. 112: 166-178 (2018)
![](https://dblp.uni-trier.de/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.