Towards the Efficient Generation of Gray Codes in the Bitprobe Model

  • Zachary Frenette
  • Published 2016
We examine the problem of representing integers modulo L so that both increment and decrement operations can be performed efficiently. This problem is studied in the bitprobe model, where the complexity of the underlying problem is measured by the number of bit operations performed on the data structure [18]. In this thesis, we will primarily be interested… (More)