Browsing Mathematics (Faculty of) by Subject "theoretical computer science"
Now showing items 1-4 of 4
-
Halfway to Halfspace Testing
(University of Waterloo, 2017-10-18)In this thesis I study the problem of testing halfspaces under arbitrary probability distributions, using only random samples. A halfspace, or linear threshold function, is a boolean function f : Rⁿ → {±1} defined as the ... -
A Las Vegas Algorithm for the Ordered Majority Problem
(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
(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 ... -
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures
(University of Waterloo, 2008-01-23)The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices ...