Huacheng Yu. Optimal succinct rank data structure via approximate nonnegative tensor decomposition. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 955-966, ACM, 2019. [doi]
@inproceedings{Yu19-17,
title = {Optimal succinct rank data structure via approximate nonnegative tensor decomposition},
author = {Huacheng Yu},
year = {2019},
doi = {10.1145/3313276.3316352},
url = {https://doi.org/10.1145/3313276.3316352},
researchr = {https://researchr.org/publication/Yu19-17},
cites = {0},
citedby = {0},
pages = {955-966},
booktitle = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019},
editor = {Moses Charikar and Edith Cohen},
publisher = {ACM},
isbn = {978-1-4503-6705-9},
}