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 3 of 3 for “"subsequence problems"”.

  1. Aspects of random matrix theory: concentration and subsequence problems

    … focuses on relations between limiting law in subsequence problems and spectra of random matrices.

    gatech Repository record for Aspects of random matrix theory: concentration and subsequence problems (opens in a new tab)

  2. Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System

    … performance of parallel algorithms related to subsequence problems. The problems include string to string correction problem, to determine the longest common subsequence problem and solving the sum-range-product, 1 —D pattern matching, longest non-decreasing (non-increasing) (LNS) and maximum …

    unt Repository record for Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System (opens in a new tab)

  3. Quantum Query Algorithms: Design, Optimality, Complexity

    … algorithms for a variety of string processing problems, such as decision versions of the string rotation, string suffix, longest increasing subsequence, and longest common subsequence problems. Next, we study translation-invariant quantum algorithms for the ordered search problem. On a …

    maryland Repository record for Quantum Query Algorithms: Design, Optimality, Complexity (opens in a new tab)