Now showing items 49-68 of 2515

    • Algebraic Analysis of Vertex-Distinguishing Edge-Colorings 

      Clark, David (University of Waterloo, 2006)
      Vertex-distinguishing edge-colorings (vdec colorings) are a restriction of proper edge-colorings. These special colorings require that the sets of edge colors incident to every vertex be distinct. This is a relatively ...
    • Algebraic and combinatorial aspects of incidence groups and linear system non-local games arising from graphs 

      Paddock, Connor (University of Waterloo, 2019-06-06)
      To every linear binary-constraint system (LinBCS) non-local game, there is an associated algebraic object called the solution group. Cleve, Liu, and Slofstra showed that a LinBCS game has a perfect quantum strategy if and ...
    • Algebraic Approaches to State Complexity of Regular Operations 

      Davies, Sylvie (University of Waterloo, 2019-10-15)
      The state complexity of operations on regular languages is an active area of research in theoretical computer science. Through connections with algebra, particularly the theory of semigroups and monoids, many problems ...
    • Algebraic Aspects of Multi-Particle Quantum Walks 

      Smith, Jamie (University of Waterloo, 2012-12-04)
      A continuous time quantum walk consists of a particle moving among the vertices of a graph G. Its movement is governed by the structure of the graph. More formally, the adjacency matrix A is the Hamiltonian that determines ...
    • Algebraic characterization of multivariable dynamics 

      Ramsey, Christopher (University of Waterloo, 2009-03-26)
      Let X be a locally compact Hausdorff space along with n proper continuous maps σ = (σ1 , · · · , σn ). Then the pair (X, σ) is called a dynamical system. To each system one can associate a universal operator algebra called ...
    • The Algebraic Kirchberg--Phillips Conjecture for Leavitt Path Algebras 

      Hossain, Ehsaan (University of Waterloo, 2015-09-18)
      This essay is meant to be an exposition of the theory of Leavitt path algebras and graph C*-algebras, with an aim to discuss some current classification questions. These two classes of algebras sit on opposite sides of a ...
    • Algebraic Methods and Monotone Hurwitz Numbers 

      Guay-Paquet, Mathieu (University of Waterloo, 2012-09-21)
      We develop algebraic methods to solve join-cut equations, which are partial differential equations that arise in the study of permutation factorizations. Using these techniques, we give a detailed study of the recently ...
    • Algebraic Methods for Reducibility in Nowhere-Zero Flows 

      Li, Zhentao (University of Waterloo, 2007-09-25)
      We study reducibility for nowhere-zero flows. A reducibility proof typically consists of showing that some induced subgraphs cannot appear in a minimum counter-example to some conjecture. We derive algebraic proofs of ...
    • Algebraic Multigrid for Markov Chains and Tensor Decomposition 

      Miller, Killian (University of Waterloo, 2013-01-23)
      The majority of this thesis is concerned with the development of efficient and robust numerical methods based on adaptive algebraic multigrid to compute the stationary distribution of Markov chains. It is shown that classical ...
    • Algebraic Tori in Cryptography 

      Alexander, Nicholas Charles (University of Waterloo, 2005)
      Communicating bits over a network is expensive. Therefore, cryptosystems that transmit as little data as possible are valuable. This thesis studies several cryptosystems that require significantly less bandwidth than ...
    • An Algorithm for Stable Matching with Approximation up to the Integrality Gap 

      Tofigzade, Natig (University of Waterloo, 2020-07-10)
      In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of agents, each of whom has ordinal preferences over the members of the opposite group. The goal is to ...
    • Algorithm Substitution Attacks: Detecting ASAs Using State Reset and Making ASAs Asymmetric 

      Hodges, Philip (University of Waterloo, 2021-08-27)
      The field of cryptography has made incredible progress in the last several decades. With the formalization of security goals and the methods of provable security, we have achieved many privacy and integrity guarantees in ...
    • Algorithmic Analysis of a General Class of Discrete-based Insurance Risk Models 

      Singer, Basil Karim (University of Waterloo, 2013-08-28)
      The aim of this thesis is to develop algorithmic methods for computing particular performance measures of interest for a general class of discrete-based insurance risk models. We build upon and generalize the insurance ...
    • Algorithmic Analysis of Infinite-State Systems 

      Hassanzadeh Ghaffari, Naghmeh (University of Waterloo, 2009-02-10)
      Many important software systems, including communication protocols and concurrent and distributed algorithms generate infinite state-spaces. Model-checking which is the most prominent algorithmic technique for the verification ...
    • Algorithms and Design Principles for Rural Kiosk Networks 

      Guo, Shimin (University of Waterloo, 2007-09-19)
      The KioskNet project aims to provide extremely low-cost Internet access to rural kiosks in developing countries, where conventional access technologies, \eg\, DSL, CDMA and dial-up, are currently economically infeasible. ...
    • Algorithms and Models for Tensors and Networks with Applications in Data Science 

      Winlaw, Manda (University of Waterloo, 2016-01-19)
      Big data plays an increasingly central role in many areas of research including optimization and network modeling. We consider problems applicable to large datasets within these two branches of research. We begin by ...
    • Algorithms for Characterizing Peptides and Glycopeptides with Mass Spectrometry 

      He, Lin (University of Waterloo, 2013-09-26)
      The emergence of tandem mass spectrometry (MS/MS) technology has significantly accelerated protein identification and quantification in proteomics. It enables high-throughput analysis of proteins and their quantities in a ...
    • Algorithms for fast linear system solving and rank profile computation 

      Yang, Shiyun (University of Waterloo, 2014-07-16)
      We give randomized algorithms for linear algebra problems concerning an n*m input matrix A over a field K. We give an algorithm that simultaneously computes the row and column rank profiles of A in 2r^3 + (r^2+n+m+|A|)^{1+o(1)} ...
    • Algorithms for Geometric Covering and Piercing Problems 

      Fraser, Robert (University of Waterloo, 2013-01-10)
      This thesis involves the study of a range of geometric covering and piercing problems, where the unifying thread is approximation using disks. While some of the problems addressed in this work are solved exactly with ...
    • Algorithms for Linearly Recurrent Sequences of Truncated Polynomials 

      Hyun, Seung Gyu (University of Waterloo, 2021-08-17)
      Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences ...


      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