Search Results - Salmerón, J.M.G.

  • Showing 1 - 2 results of 2
Refine Results
  1. 1
    Parallel algorithms for computing the smallest binary tree size in unit simplex refinement

    Parallel algorithms for computing the smallest binary tree size in unit simplex refinement by Aparicio, G., Salmerón, J.M.G., Casado, L.G., Asenjo, R., Hendrix, E.M.T.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

    Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement by Salmerón, J. M. G., Aparicio, G., Casado, L. G., García, I., Hendrix, E. M. T., G.-Tóth, B.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:

Search Tools: