@inproceedings{c68b6e5ad0b949c5b0debd9ea6ef3a1e,
title = "An improved query time for succinct dynamic dictionary matching",
abstract = "In this work, we focus on building an efficient succinct dynamic dictionary that significantly improves the query time of the current best known results. The algorithm that we propose suffers from only a O((loglogn)2) multiplicative slowdown in its query time and a slowdown for insertion and deletion operations, where n is the sum of all of the patterns' lengths, the size of the alphabet is polylog(n) and ε∈ (0,1). For general alphabet the query time is O((log log n) log σ), where σ is the size of the alphabet. A byproduct of this paper is an Aho-Corasick automaton that can be constructed with only a compact working space, which is the first of its type to the best of our knowledge.",
author = "Guy Feigenblat and Ely Porat and Ariel Shiftan",
year = "2014",
doi = "https://doi.org/10.1007/978-3-319-07566-2_13",
language = "الإنجليزيّة",
isbn = "9783319075655",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "120--129",
booktitle = "Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings",
address = "ألمانيا",
note = "25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014 ; Conference date: 16-06-2014 Through 18-06-2014",
}