Corpus ID: 36284305

Towards the Efficient Generation of Gray Codes in the Bitprobe Model

@inproceedings{Frenette2016TowardsTE,
  title={Towards the Efficient Generation of Gray Codes in the Bitprobe Model},
  author={Zachary Frenette},
  year={2016}
}
  • Zachary Frenette
  • Published 2016
  • Computer Science
  • 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 in constructing space-optimal data structures. That is, we would like to use exactly n bits to represent integers modulo 2. Brodal et al… CONTINUE READING

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES

    A Survey of Data Structures in the Bitprobe Model

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Integer Representation and Counting in the Bit Probe Model

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation

    VIEW 1 EXCERPT

    Bit-Probe Lower Bounds for Succinct Data Structures

    VIEW 1 EXCERPT