Cache-Friendly Compressed Boolean Matrices.
Antonio Fariña|Adrián Gómez-Brandón|Asunción Gómez-Colomer|Gonzalo Navarro
| Anthology ID: | DBLP:conf/spire/FarinaGGN25 |
|---|---|
| Volume: | String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings |
| Year: | 2025 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 95-108 |
| URL: | https://doi.org/10.1007/978-3-032-05228-5_9 |
| DOI: | https://doi.org/10.1007/978-3-032-05228-5_9 |
| DBLP: | conf/spire/FarinaGGN25 |
| BibTeX: |
@inproceedings{farina-2025-cachefriendly,
author = {Antonio Fari\~{n}a and
Adri\'{a}n G\'{o}mez-Brand\'{o}n and
Asunci\'{o}n G\'{o}mez-Colomer and
Gonzalo Navarro},
editor = {Golnaz Badkobeh and
Jakub Radoszewski and
Nicola Tonellotto and
Ricardo Baeza-Yates},
title = {{Cache-Friendly Compressed Boolean Matrices}},
booktitle = {{String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {16073},
pages = {95--108},
publisher = {Springer},
year = {2025},
url = {https://doi.org/10.1007/978-3-032-05228-5_9},
doi = {https://doi.org/10.1007/978-3-032-05228-5_9}
}