A General Technique for Managing Strings in Comparison-Driven Data Structures

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

• Type: Conference
• Year: 2004
• Where: ICALP
• Authors: Gianni Franceschini, Roberto Grossi
• Keywords: Data Structure, Dynamic Data Structure, ICALP 2004, Indivisible Keys, Theoretical Computer Science