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

  1. Exploiting balanced trees in the computation of elementary flux modes via breadth-first search

    … search algorithm is needed. I have employed balanced trees to speed up the breadth-first search. Specific examples, including the maximization of succinate production, will be investigated and the vertices of the mixed acid fermentation process in E. coli will be enumerated. The open source …

    rice Repository record for Exploiting balanced trees in the computation of elementary flux modes via breadth-first search (opens in a new tab)

  2. Memory Protection with Cached Authentication Trees

    … For example, static tree designs such as TEC-Trees have been proven effective in the past, but have limited performance in certain access patterns (workloads). Most recently proposed dynamically balanced trees provide an additional solution with improved performance in certain workloads, …

    rit Repository record for Memory Protection with Cached Authentication Trees (opens in a new tab)

  3. Multi-way self-adjusting data structures: a general theory and some limitations

    … we can do better than classical binary search trees, namely in biased searching, when balanced trees “lose” because of their “over-balancedness”. The classical answer to this problem, biased search trees, is clearly of little practical use because of the strict assumptions made. We present the …

    greece Repository record for Multi-way self-adjusting data structures: a general theory and some limitations (opens in a new tab)

  4. Analyses and Cost Evaluation of Code Tree Search Algorithms

    … S). The second algorithm uses a class of height-balanced trees, known as AVL trees, to store code tree paths, resulting in an alternate method to the merge algorithm achieving O(S log S) cost.</p> <p> The third algorithm, using the concepts of dynamic hashing and trie searching, provides …

    mcmaster Repository record for Analyses and Cost Evaluation of Code Tree Search Algorithms (opens in a new tab)

  5. 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)

  6. Verification of sequential and concurrent libraries

    … data values of nodes in linked lists, binary trees, and directed acyclic graphs; methods to reverse linked lists; and methods to rotate balanced trees. Well-written methods are accompanied by documentation that specifies the observational behavior of these methods in terms of …

    texas Repository record for Verification of sequential and concurrent libraries (opens in a new tab)