Now showing items 1-13 of 13

    • Approximately Optimum Search Trees in External Memory Models 

      Grant, Oliver David Lester (University of Waterloo, 2016-05-16)
      We examine optimal and near optimal solutions to the classic binary search tree problem of Knuth. We are given a set of n keys (originally known as words), B_1, B_2, ..., B_n and 2n+1 frequencies. {p_1, p_2, ..., p_n} ...
    • Compact Routing on Planar Graphs 

      Seyedi, Newsha (University of Waterloo, 2024-01-04)
      This thesis delves into the exploration of shortest path queries in planar graphs, with an emphasis on the utilization of space-efficient data structures. Our investigation primarily targets connected, undirected, static ...
    • Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts 

      Sandlund, Bryce (University of Waterloo, 2021-04-30)
      This thesis considers the study of data structures from the perspective of the theoretician, with a focus on simplicity and practicality. We consider both the time complexity as well as space usage of proposed solutions. ...
    • Efficient Representation and Encoding of Distributive Lattices 

      Sinnamon, Corwin (University of Waterloo, 2018-08-20)
      This thesis presents two new representations of distributive lattices with an eye towards efficiency in both time and space. Distributive lattices are a well-known class of partially-ordered sets having two natural operations ...
    • In-Memory Storage for Labeled Tree-Structured Data 

      Zhou, Gelin (University of Waterloo, 2017-03-16)
      In this thesis, we design in-memory data structures for labeled and weights trees, so that various types of path queries or operations can be supported with efficient query time. We assume the word RAM model with word size ...
    • A Las Vegas Algorithm for the Ordered Majority Problem 

      Baral, Ben (University of Waterloo, 2022-09-29)
      In this thesis, we study the majority problem using ordered comparisons under the Las Vegas randomized algorithm model. The majority problem asks whether a given set of n elements, each with some colour, has a colour which ...
    • Majority in the Three-Way Comparison Model 

      Nazari, Azin (University of Waterloo, 2019-08-28)
      In this thesis, we study comparison based problems in a new comparison model called three-way, where a comparison can result in { >, =, < }. We consider a set of n balls with fixed ordered coloring. Particularly, we are ...
    • Optimal Path-Decomposition of Tries 

      Daigle, Alexandre (University of Waterloo, 2016-05-16)
      In this thesis, we consider the path-decomposition representation of prefix trees. We show that given query probabilities for every word in the prefix tree, the heavy-path strategy produces the optimal trie with respect ...
    • Performance of the Ultra-Wide Word Model 

      Pérez Gavilán Torres, Camila María (University of Waterloo, 2017-09-08)
      The Ultra-wide word model of computation (UWRAM) is an extension of the Word-RAM model which has an ALU that can operate on w^2 bits at a time, where w is the size in bits of a cell in memory. The purpose of this thesis ...
    • Space Efficient Data Structures and Algorithms in the Word-RAM Model 

      El-Zein, Hicham (University of Waterloo, 2018-04-30)
      In modern computation the volume of data-sets has increased dramatically. Since the majority of these data-sets are stored in internal memory, reducing their storage requirement is an important research topic. One way ...
    • Succinct and Compact Data Structures for Intersection Graphs 

      Wu, Kaiyu (University of Waterloo, 2023-08-14)
      This thesis designs space efficient data structures for several classes of intersection graphs, including interval graphs, path graphs and chordal graphs. Our goal is to support navigational operations such as adjacent and ...
    • Succinct Data Structures for Chordal Graphs 

      Wu, Kaiyu (University of Waterloo, 2019-04-10)
      We study the problem of approximate shortest path queries in chordal graphs and give a n log n + o(n log n) bit data structure to answer the approximate distance query to within an additive constant of 1 in O(1) time. We ...
    • Towards the Efficient Generation of Gray Codes in the Bitprobe Model 

      Frenette, Zachary (University of Waterloo, 2016-05-13)
      We examine the problem of representing integers modulo L so that both increment and decrement operations can be performed efficiently. This problem is studied in the bitprobe model, where the complexity of the underlying ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages