Skip to main content
Article

A general technique for managing strings in comparison-driven data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-540-27836-8_52
13Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a general technique for optimally transforming any dynamic data structure script D that operates on atomic and indivisible keys by constant-time comparisons, into a data structure script D′ that handles unbounded-length keys whose comparison cost is not a constant. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Franceschini, G., & Grossi, R. (2004). A general technique for managing strings in comparison-driven data structures. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. https://doi.org/10.1007/978-3-540-27836-8_52

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