Search for dissertations about: "Tree Algorithms"
Showing result 1 - 5 of 108 swedish dissertations containing the words Tree Algorithms.
-
1. Studies in Efficient Discrete Algorithms
Abstract : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. READ MORE
-
2. Constructing Evolutionary Trees - Algorithms and Complexity
Abstract : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. READ MORE
-
3. Contributions to the theory and applications of tree languages
Abstract : This thesis is concerned with theoretical as well as practical aspects of tree languages. It consists of an introduction and eight papers, organised into three parts. READ MORE
-
4. Structures of String Matching and Data Compression
Abstract : This doctoral dissertation presents a range of results concerning efficient algorithms and data structures for string processing, including several schemes contributing to sequential data compression. It comprises both theoretic results and practical implementations. READ MORE
-
5. Tree Structures in Broadcast Encryption
Abstract : The need for broadcast encryption arises when a sender wishes to securely distribute messages to varying subsets of receivers, using a broadcast channel, for instance in a pay-TV scenario. This is done by selecting subsets of users and giving all users in the same subset a common decryption key. READ MORE