Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"linearly ordered data structures"”.

  1. Linearly Ordered Concurrent Data Structures on Hypercubes

    … simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of a pruned binomial search tree rooted at any arbitrary node of the binary hypercube. The tree spans any arbitrary sequence of n consecutive nodes containing the …

    unt Repository record for Linearly Ordered Concurrent Data Structures on Hypercubes (opens in a new tab)