A novel data structure called 'tiny pointer' is introduced, enabling the replacement of traditional logn-bit pointers with o(logn)-bit pointers while maintaining constant-factor time overhead. The research presents optimal constructions for both fixed-size and variable-size tiny pointers, demonstrating practical applications in five classic data structure problems.

https://arxiv.org/abs/2111.12800

#datastructures #algorithms #memoryoptimization #computerscience #pointersystems