The DOI matches its Crossref record; 35 of the 36 references it cites were found in a registry or an index.
The Wavelet Matrix
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, canonical wavelet matrices are static and operate over a single homogeneous sequence, making them incompatible with agentic workloads where memory is continuously appended and must be immediately available for retrieval.”
From Hippocampus: An Efficient and Scalable Memory Module for Agentic AI (2026) · cites this paper as Claude & Navarro, 2012
Citations
Cites
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
Ferragina, P., & Manzini, G. (2005) · Journal of the ACM · doi:10.1145/1082036.1082039 · Cited by 686 · cited 2×
“Our result, which is of practical nature, will have a large impact in a number of applications where the levelwise wavelet tree was used: compressed full-text indexes [22, 29, 14, 24, 7, 4, 11, 23], inverted indexes [9, 1, 31, 17], document retrieval [36, 18, 16, 13, 17, 32], graph representations [9, 10], discrete gr…”
MethodHigh-order entropy-compressed text indexes
Grossi, R., Gupta, A. K., & Vitter, J. S. (2003) · doi:10.5555/644108.644250 · Cited by 648
Space-efficient static trees and graphs
Jacobson, G. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63533 · Cited by 634 · cited 2×
“Binary rank and select operations can be carried out in constant time using only o(nv) bits on top of Bv [21, 28, 8].”
BackgroundMethodSuccinct indexable dictionaries with applications to encoding k-ary trees and multisets
Raman, R., Raman, V., & Satti, S. R. (2002) · doi:10.5555/545381.545411 · Cited by 387
Compressed representations of sequences and full-text indexes
Ferragina, P., Manzini, G., Mäkinen, V., & Navarro, G. (2007) · ACM Transactions on Algorithms · doi:10.1145/1240233.1240243 · Cited by 373
Self-citationClark, D. R. (1998) · Cited by 269
Munro, J. I. (1996) · Lecture notes in computer science · doi:10.1007/3-540-62034-6_35 · Cited by 185
Rank and select revisited and extended
Mäkinen, V., & Navarro, G. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.07.013 · Cited by 161 · cited 6×
“Implicit compression boosting: Mäkinen and Navarro [25, 27] proved that the wavelet tree of the BWT [6] of a text T , if its bitmaps are compressed to zero-order entropy (e.g., using Raman et al. [34]), would achieve highorder entropy compression of T .”
BackgroundSelf-citationPractical Rank/Select Queries over Arbitrary Sequences
Claude, F., & Navarro, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89097-3_18 · Cited by 148 · cited 5×
“The second version, RRR, corresponds to the implementation [9] of the proposal of Raman, Raman and Rao [34].”
BackgroundMethodSelf-citation
Research works printed but not linked: 2
- González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Proc. 4th Workshop on Efficient and Experimental Algorithms (WEA), pp. 27–38 (2005) (posters)
- Kärkkäinen, J.: Repetition-Based Text Indexing. Ph.D. thesis, Univ. of Helsinki, Finland (1999)
Cited by
Navarro, G. (2013) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2013.07.004 · Cited by 173
“A recent solution to this is the so-called “wavelet matrix” [15].”
MethodSelf-citationThe wavelet matrix: An efficient wavelet tree for large alphabets
Claude, F., Navarro, G., & Ordóñez, A. (2014) · Information Systems · doi:10.1016/j.is.2014.06.002 · Cited by 77
“SPIRE 2012 [23].”
Self-citationNavarro, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31265-6_2 · Cited by 68
Self-citationLigra: A Lightweight Graph Processing Framework for Shared Memory
Shun, J. (2017) · doi:10.1145/3018787.3018795 · Cited by 58
Parallel Wavelet Tree Construction
Shun, J. (2015) · DCC · doi:10.1109/dcc.2015.7 · Cited by 42
“Finally, we discuss how to adapt our algorithms to variants of wavelet trees— Huffman-shaped wavelet trees [11], multiary wavelet trees [10], and wavelet matrices [7].”
BackgroundMethodInfluential
Metadata
- Authors
- Claude, F., & Navarro, G.
- Affiliations
- University of Waterloo (CA)
- University of Chile (CL)
- ORCID
- Navarro, Gonzalo
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 167-179
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1860929530
- Cited by
- 47
- References
- 36
- Citations by year
- 2025: 1 · 2023: 1 · 2022: 1 · 2020: 1 · 2018: 5 · 2017: 19 · 2016: 7 · 2015: 4 · 2014: 4 · 2013: 3 · 2012: 1
- FWCI
- 2.89
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Keywords
- wavelet tree, succinct data structures, text indexing, bitmaps, string data structures
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Wavelet Matrix. https://app.cochat.ai/papers/10.1007/978-3-642-34109-0_18
- The paper
- Claude, F., & Navarro, G. (2012). The Wavelet Matrix. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-34109-0_18
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.