"Parallel algorithms for computing the smallest binary tree size in unit ..."

Guillermo Aparicio et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.JPDC.2017.05.016

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jpdc/AparicioSCAH18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/AparicioSCAH18
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)

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.