Now showing items 1-3 of 3

    • Adaptive Range Counting and Other Frequency-Based Range Query Problems 

      Wilkinson, Bryan T. (University of Waterloo, 2012-05-18)
      We consider variations of range searching in which, given a query range, our goal is to compute some function based on frequencies of points that lie in the range. The most basic such computation involves counting the ...
    • 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 ...

      UWSpace

      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