This is the collection for the University of Waterloo's Cheriton School of Computer Science .

Research outputs are organized by type (eg. Master Thesis, Article, Conference Paper).

Waterloo faculty, students, and staff can contact us or visit the UWSpace guide to learn more about depositing their research.

Recent deposits

  • WatchTrace: Design and Evaluation of an At-Your-Side Gesture Paradigm 

    Siddhpuria, Shaishav (University of Waterloo, 2017-11-16)
    In this thesis, we present the exploration and evaluation of a gesture interaction paradigm performed with arms at rest at the side of one's body. This gesture stance is informed persisting challenges in mid-air arm gesture ...
  • Syntactic Complexities of Six Classes of Star-Free Languages 

    Brzozowski, Janusz; Li, Baiyu; Liu, David (Otto-von-Guericke-Universit¨at Magdeburg, 2012)
    The syntactic complexity of a regular language is the cardinality of its syntactic semi-group. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ...
  • Quotient complexity of ideal languages 

    Brzozowski, Janusz; Jirásková, Galina; Li, Baiyu (Elsevier, 2013-01-28)
    A language L over an alphabet Σ is a right (left) ideal if it satisfies L=LΣ∗ (L=Σ∗L). It is a two-sided ideal if L=Σ∗LΣ∗, and an all-sided ideal if L=Σ∗L, the shuffle of Σ∗ with L. Ideal languages are not only of interest ...
  • Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages 

    Brzozowski, Janusz; Li, Baiyu; Ye, Yuli (Elsevier, 2012-08-31)
    The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in ...
  • Most Complex Regular Ideal Languages 

    Liu, Bo Yang Victor; Davies, Sylvie; Brzozowski, Janusz (Discrete Mathematics and Theoretical Computer Science, 2016-10-17)
    A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for ...
  • Trust Region Methods for Training Neural Networks 

    Kinross, Colleen (University of Waterloo, 2017-11-09)
    Artificial feed-forward neural networks (ff-ANNs) serve as powerful machine learning models for supervised classification problems. They have been used to solve problems stretching from natural language processing to ...
  • Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs 

    Tracey, Justin (University of Waterloo, 2017-10-30)
    Tor is the most popular tool for providing online anonymity. It is used by journalists, activists, and privacy-conscious individuals to provide low-latency private access to the Internet. However, Tor’s specific design and ...
  • HybridPointing Touch: A Technique to Switch Between Absolute and Relative Pointing on Large Touch Screens 

    DIckson, Terence (University of Waterloo, 2017-10-25)
    We extend Forlines et al.'s idea of mixed absolute and relative "HybridPointing" to large multitouch displays. In our bimanual "CursorTap" interaction technique, one hand triggers a kinaesthetic relative pointing mode while ...
  • Straight Line Movement in Morphing and Pursuit Evasion 

    Vosoughpour Yazdchi, Hamideh (University of Waterloo, 2017-10-24)
    Piece-wise linear structures are widely used to define problems and to represent simplified solutions in computational geometry. A piece-wise linear structure consists of straight-line or linear pieces connected together ...
  • A spiking neural network of state transition probabilities in model-based reinforcement learning 

    Shein, Mariah (University of Waterloo, 2017-10-23)
    The development of the field of reinforcement learning was based on psychological studies of the instrumental conditioning of humans and other animals. Recently, reinforcement learning algorithms have been applied to ...
  • Verifying Mutable Systems 

    Scott, Joseph (University of Waterloo, 2017-10-23)
    Model checking has had much success in the verification of single-process and multi-process programs. However, model checkers assume an immutable topology which limits the verification in several areas. Consider the security ...
  • 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 ...
  • Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language 

    Brzozowski, Janusz; Jirásková, Galina; Baiyu, Li; Smith, Joshua (Institute of Informatics: University of Szeged, 2014)
    A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", ...
  • Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages 

    Brzozowski, Janusz; Sinnamon, Corwin (Institute of Informatics: University of Szeged, 2017)
    A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free ...
  • Quotient Complexities of Atoms in Regular Ideal Languages 

    Brzozowski, Janusz; Davies, Sylvie (Institute of Informatics: University of Szeged, 2015)
    A (left) quotient of a language L by a word w is the language w(-1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ...
  • The Positive and Negative Influence of Search Results on People's Decisions about the Efficacy of Medical Treatments 

    Pogacar, Frances A.; Ghenai, Amira; Smucker, Mark D.; Clarke, Charles L. A. (ACM, 2017-10-01)
    People regularly use web search engines to investigate the efficacy of medical treatments. Search results can contain documents that present incorrect information that contradicts current established medical understanding ...
  • In Search Of Most Complex Regular Languages 

    Brzozowski, Janusz (World Scientific Publishing, 2013-09-01)
    Sequences (L-n vertical bar n >= k), called streams, of regular languages L-n are considered, where k is some small positive integer, n is the state complexity of L-n, and the languages in a stream differ only in the ...
  • On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions 

    Brzozowski, Janusz; Li, Baiyu; Ye, Yuli (World Scientific Publishing, 2012-01-01)
    Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions ...
  • Quotient Complexity Of Star-Free Languages 

    Brzozowski, Janusz; Liu, Bo (World Scientific Publishing, 2012-09-01)
    The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the ...
  • Complexity Of Atoms Of Regular Languages 

    Brzozowski, Janusz; Tamm, Hellis (World Scientific Publishing, 2013-11-01)
    The quotient complexity of a regular language L, which is the same as its state complexity the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n ...

View more


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