Dynamic string searching

MaRDI QIDQ2768310zbMATH OpenFDO

Authors Arne Andersson, Mikkel Thorup

Publication date 30 January 2002

zbMATH Keywords

dynamic string searching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Improved Dynamic Text Indexing
• Dynamic ordered sets with exponential search trees
• Optimal On-Line Search and Sublinear Time Update in String Matching
• scientific article; zbMATH DE number 1445383

Cited in

(6)

• I/O efficient dynamic data structures for longest prefix queries
• Tight bounds for searching a sorted array of strings
• I/O Efficient Dynamic Data Structures for Longest Prefix Queries
• Dynamic ordered sets with exponential search trees
• Automata, Languages and Programming
• New method in information processing for maintaining an efficient dynamic ordered set

This page was built for publication: Dynamic string searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768310)