I/O Efficient Dynamic Data Structures for Longest Prefix Queries

Moshe Hershcovitch, Haim Kaplan. I/O Efficient Dynamic Data Structures for Longest Prefix Queries. In Joachim Gudmundsson, editor, Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings. Volume 5124 of Lecture Notes in Computer Science, pages 29-40, Springer, 2008. [doi]

Abstract

Abstract is missing.