Sökning: "Data Structures Sorting"

Visar resultat 1 - 5 av 13 avhandlingar innehållade orden Data Structures Sorting.

  1. 1. Studies in Applied Data Structures

    Författare :Kurt Swanson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Systems engineering; Sparse Matrix; Suffix Tree; Roundness; Range searching; Data- och systemvetenskap; computer technology;

    Sammanfattning : The design of efficient data structures is of primary importance in creation of theoretical algorithms as well their more tangible descendants, computer programs. In this dissertation we study computational aspects of data structures and their respective algorithms from a theoretical viewpoint, which are however of direct importance in the implementation of solutions for real-world problems. LÄS MER

  3. 2. Structures of String Matching and Data Compression

    Författare :N Jesper Larsson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Implementation; Burrows-Wheeler Transform; Sliding Window; Suffix Sorting; Text Compression; Algorithms; Suffix Tree; Systems engineering; computer technology; Data- och systemvetenskap;

    Sammanfattning : 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. LÄS MER

  4. 3. Concurrent Algorithms and Data Structures for Many-Core Processors

    Författare :Daniel Cederman; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; composition; sorting; graphics processors; lock-free; software transactional memory; parallel; load balancing; multi-core;

    Sammanfattning : The convergence of highly parallel many-core graphics processors with conventional multi-core processorsis becoming a reality.To allow algorithms and data structures to scale efficiently on these new platforms,several important factors needs to be considered. LÄS MER

  5. 4. Non-blocking Synchronization: Algorithms and Performance Evaluation

    Författare :Yi Zhang; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : The thesis investigates non-blocking synchronization in shared memory systems, in particular in high performance shared memory multiprocessors and real-time shared memory systems. We explore the performance impact of non-blocking synchronization in high performance shared memory multiprocessors and the applicability of non-blocking synchronization in real-time systems. LÄS MER

  7. 5. Testing and Proving in Dependent Type Theory

    Författare :Qiao Haiyan; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : We show how random testing, model checking and interactive proving can be combined for functional program verification in dependent type theory. We extend the proof assistant Agda/Alfa for dependent type theory with a tool for random testing of functional programs, thus combining proving and testing in one system. LÄS MER