Now showing items 1-8 of 8

    • The Complexity of Finding Dense Subgraphs in Graphs with Large Cliques 

      Seth, Cameron (University of Waterloo, 2021-08-25)
      The GapDensest-k-Subgraph(d) problem (GapDkS(d)) is defined as follows: given a graph G and parameters k,d, distinguish between the case that G contains a k-clique, and the case that every k-subgraph of G has density at ...
    • Complexity of Sublinear Algorithms for Convexity in Higher Dimensions 

      Bommireddi, Venkata Abhinav (University of Waterloo, 2022-07-19)
      Convexity plays a prominent role in both mathematics and computer science. It is defined for sets and functions, and many related problems can be solved efficiently if the set/function is convex. In this thesis, we focus ...
    • Domain Ordering and Box Cover Problems for Beyond Worst-Case Join Processing 

      Alway, Kaleb (University of Waterloo, 2019-09-17)
      Join queries are a fundamental computational task in relational database management systems. For decades, complex joins were most often computed by decomposing the query into a query plan made of a sequence of binary joins. ...
    • Halfway to Halfspace Testing 

      Harms, Nathaniel (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 ...
    • Monotonicity Testing for Boolean Functions over Graph Products 

      Chen, Zhengkun (University of Waterloo, 2020-09-09)
      We establish a directed analogue of Chung and Tetali's isoperimetric inequality for graph products. We use this inequality to obtain new bounds on the query complexity for testing monotonicity of Boolean-valued functions ...
    • On Tolerant Testing and Tolerant Junta Testing 

      Levi, Amit (University of Waterloo, 2020-07-08)
      Over the past few decades property testing has became an active field of study in theoretical computer science. The algorithmic task is to determine, given access to an unknown large object (e.g., function, graph, probability ...
    • Testing Submodularity 

      Bommireddi, Venkata Abhinav (University of Waterloo, 2017-09-28)
      We show that for any constants $\epsilon > 0$ and $p \ge 1$, given oracle access to an unknown function $f : \{0,1\}^n \to [0,1]$ it is possible to determine if the function is submodular or is $\epsilon$-far from every ...
    • Testing, Learning, Sampling, Sketching 

      Harms, Nathaniel (University of Waterloo, 2022-08-22)
      We study several problems about sublinear algorithms, presented in two parts. Part I: Property testing and learning. There are two main goals of research in property testing and learning theory. The first is to understand ...


      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