Now showing items 229-248 of 433

    • MAC Constructions: Security Bounds and Distinguishing Attacks 

      Mandal, Avradip (University of Waterloo, 2007-05-18)
      We provide a simple and improved security analysis of PMAC, a Parallelizable MAC (Message Authentication Code) defined over arbitrary messages. A similar kind of result was shown by Bellare, Pietrzak and Rogaway at ...
    • Machine-Level Software Optimization of Cryptographic Protocols 

      Fishbein, Dieter (University of Waterloo, 2014-04-30)
      This work explores two methods for practical cryptography on mobile devices. The first method is a quantum-resistant key-exchange protocol proposed by Jao et al.. As the use of mobile devices increases, the deployment of ...
    • MacLane's Theorem for Graph-Like Spaces 

      Rooney, Brendan (University of Waterloo, 2008-09-12)
      The cycle space of a finite graph is the subspace of the edge space generated by the edge sets of cycles, and is a well-studied object in graph theory. Recently progress has been made towards extending the theory of cycle ...
    • The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm 

      Wang, Xiaojing (University of Waterloo, 2015-08-11)
      This thesis presents our findings about the Master Equality Polyhedron (MEP), an extension of Gomory's Master Group Polyhedron. We prove a theorem analogous to Gomory and Johnson's two-slope theorem for the case of the ...
    • The Matching Augmentation Problem: A 7/4-Approximation Algorithm 

      Dippel, Jack (University of Waterloo, 2019-05-23)
      We present a 7/4 approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2-edge connected ...
    • Matchings and Covers in Hypergraphs 

      Szestopalow, Michael (University of Waterloo, 2016-05-17)
      In this thesis, we study three variations of matching and covering problems in hypergraphs. The first is motivated by an old conjecture of Ryser which says that if $\mcH$ is an $r$-uniform, $r$-partite hypergraph which ...
    • Matchings and games on networks 

      Farczadi, Linda (University of Waterloo, 2015-08-20)
      We investigate computational aspects of popular solution concepts for different models of network games. In chapter 3 we study balanced solutions for network bargaining games with general capacities, where agents can ...
    • Matchings and Representation Theory 

      Lindzey, Nathan (University of Waterloo, 2018-12-20)
      In this thesis we investigate the algebraic properties of matchings via representation theory. We identify three scenarios in different areas of combinatorial mathematics where the algebraic structure of matchings gives ...
    • Mathematical Programming Formulations of the Planar Facility Location Problem 

      Zvereva, Margarita (University of Waterloo, 2007-09-24)
      The facility location problem is the task of optimally placing a given number of facilities in a certain subset of the plane. In this thesis, we present various mathematical programming formulations of the planar ...
    • Matrix Formulations of Matching Problems 

      Webb, Kerri (University of Waterloo, 2000)
      Finding the maximum size of a matching in an undirected graph and finding the maximum size of branching in a directed graph can be formulated as matrix rank problems. The Tutte matrix, introduced by Tutte as a representation ...
    • Mechanism Design For Covering Problems 

      Minooei, Hadi (University of Waterloo, 2014-01-24)
      Algorithmic mechanism design deals with efficiently-computable algorithmic constructions in the presence of strategic players who hold the inputs to the problem and may misreport their input if doing so benefits them. ...
    • Message Authentication and Recognition Protocols Using Two-Channel Cryptography 

      Mashatan, Atefeh (University of Waterloo, 2008-12-02)
      We propose a formal model for non-interactive message authentication protocols (NIMAPs) using two channels and analyze all the attacks that can occur in this model. Further, we introduce the notion of hybrid-collision ...
    • Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs 

      Cheriyan, Joseph; Hajebi, Sepehr; Qu, Zishen; Spirkl, Sophie (Elsevier, 2022-07)
      In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw (K1,3) or a net (a fixed six-vertex graph) as an induced subgraph. This implies that subject to being ...
    • Minimum Crossing Problems on Graphs 

      Roh, Patrick (University of Waterloo, 2007-01-19)
      This thesis will address several problems in discrete optimization. These problems are considered hard to solve. However, good approximation algorithms for these problems may be helpful in approximating problems in ...
    • Minimum Number of Triangles of K5 Descendants 

      Santoli, Steven (University of Waterloo, 2022-01-26)
      In the study of Quantum Field Theory and Feynman Periods, the operation of double triangle expansion plays an important role. This is largely due to double triangle expansions not affecting the maximum weight of the ...
    • Mixed Integer Programming Approaches for Group Decision Making 

      Iam, Hoi Cheong (University of Waterloo, 2022-10-26)
      Group decision making problems are everywhere in our day-to-day lives and have great influence on the daily operation of companies and institutions. With the recent advances in computational technology, it's not surprising ...
    • Modular relations of the Tutte symmetric function 

      Crew, Logan; Spirkl, Sophie (Elsevier, 2022-04)
      For a graph G, its Tutte symmetric function XBG generalizes both the Tutte polynomial TG and the chromatic symmetric function XG. We may also consider XB as a map from the t-extended Hopf algebra G[t] of labelled graphs ...
    • Modularity and Structure in Matroids 

      Kapadia, Rohan (University of Waterloo, 2013-04-22)
      This thesis concerns sufficient conditions for a matroid to admit one of two types of structural characterization: a representation over a finite field or a description as a frame matroid. We call a restriction N of a ...
    • Moments of Random Quantum Circuits and Applications in Random Circuit Sampling 

      Liu, Yinchen (University of Waterloo, 2021-12-23)
      Random quantum circuits and random circuit sampling (RCS) have recently garnered tremendous attention from all sub-fields of the quantum information community, especially after Google’s quantum supremacy announcement in ...
    • A More Accurate Measurement Model for Fault-Tolerant Quantum Computing 

      Ouyang, Yingkai (University of Waterloo, 2009-01-30)
      Aliferis, Gottesman and Preskill [1] reduce a non-Markovian noise model to a local noise model, under assumptions on the smallness of the norm of the system-bath interaction. They also prove constructively that given a ...

      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