منابع مشابه
Improved Practical Compact Dynamic Tries
We consider the problem of implementing a dynamic trie with an emphasis on good practical performance. For a trie with n nodes with an alphabet of size σ, the information-theoretic lower bound is n log σ + O(n) bits. The Bonsai data structure [1] supports trie operations in O(1) expected time (based on assumptions about the behaviour of hash functions). While its practical speed performance is ...
متن کاملImplementing Dynamic Minimal-prefix Tries
A modified trie-searching algorithm and corresponding data structure are introduced which permit rapid search of a dictionary for a symbol or a valid abbreviation. The dictionary-insertion algorithm automatically determines disambiguation points, where possible, for each symbol. The search operation will classify a symbol as one of the following unknown (i.e. not a valid symbol), ambiguous (i.e...
متن کاملDependence between External Path-Length and Size in Random Tries
We study the size and the external path length of random tries and show that they are asymptotically independent in the asymmetric case but strongly dependent with small periodic fluctuations in the symmetric case. Such an unexpected behavior is in sharp contrast to the previously known results that the internal path length is totally positively correlated to the size and that both tend to the ...
متن کاملApplications of Succinct Dynamic Compact Tries to Some String Problems
The dynamic compact trie is a fundamental data structure for a wide range of string processing problems. In this paper, we report our recent work on succinct dynamic compact tries that stores a set of strings of total length n in O(n log σ) space supporting pattern matching and insert/delete operations in O((|P |/α)f(n)) time, where P is a pattern string, α = Θ(logσ n), and f(n) = O((log logn) ...
متن کاملCoordinate Descent based Decomposed Anticipatory Dynamic Traffic Control
Traffic networks inherently exhibit several degrees of decomposition, both hierarchically and geographically, and traffic control has been, in practice, severely influenced by this decomposition. Anticipatory Traffic Control literature (Allsop, 1974), in its own, deals with the fact that user behavior can be, at least to some degree, predicted, and that an “optimal” controller should take this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2020
ISSN: 1084-6654,1084-6654
DOI: 10.1145/3418033