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 2 of 2 for “"Balanced Trees"”.

  1. Information dissemination via random walks

    … graphs, expanders, random regular graphs, balanced trees and grids. We establish that depending on the network topology, Visit-Exchange may be either slower or faster than traditional rumour spreading. In particular, in graphs consisting of hubs that are not well connected, broadcast using …

    cambridge Repository record for Information dissemination via random walks (opens in a new tab)

  2. Designing, Modeling, and Optimizing Transactional Data Structures

    … priority queue). Then, we present TxCF-Tree, a balanced tree whose design is optimized to support transactional accesses. The core optimizations of TxCF-Tree's operations are: providing a traversal phase that does not use any lock and/or speculation and deferring the lock acquisition or physical …

    vt Repository record for Designing, Modeling, and Optimizing Transactional Data Structures (opens in a new tab)