Skip to main content
Conference Proceedings

On the complexity of bv-tree updates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1191 282-293
DOI: 10.1007/3-540-62501-1_38
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Freeston, M. (1996). On the complexity of bv-tree updates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1191, pp. 282–293). Springer Verlag. https://doi.org/10.1007/3-540-62501-1_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free