Now showing items 1-2 of 2

    • The application of the in-tree knapsack problem to routing prefix caches 

      Nicholson, Patrick (University of Waterloo, 2009-04-30)
      Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and ...
    • Space-Efficient Data Structures in the Word-RAM and Bitprobe Models 

      Nicholson, Patrick (University of Waterloo, 2013-08-28)
      This thesis studies data structures in the word-RAM and bitprobe models, with an emphasis on space efficiency. In the word-RAM model of computation the space cost of a data structure is measured in terms of the number of ...

      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