Dynamic ordered sets with exponential search trees
From MaRDI portal
Publication:3546335
DOI10.1145/1236457.1236460zbMath1292.68038arXivcs/0210006OpenAlexW2149710566WikidataQ56454627 ScholiaQ56454627MaRDI QIDQ3546335
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0210006
Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)
Related Items
Dynamic layers of maxima with applications to dominating queries, Order-preserving indexing, Dynamic range majority data structures, New method in information processing for maintaining an efficient dynamic ordered set, Hyper-minimisation Made Efficient, Worst-Case Optimal Adaptive Prefix Coding, Fingerprints in compressed strings, Alphabet-Dependent String Searching with Wexponential Search Trees, Algorithms in the Ultra-Wide Word Model, Cross-document pattern matching, Time-Optimal Top-$k$ Document Retrieval, Unnamed Item, Improved bounds for finger search on a RAM, Dynamic 3-sided planar range queries with expected doubly-logarithmic time, Online binary minimax trees, New algorithms for binary jumbled pattern matching, Efficient Computation of 2-Covers of a String., Fast local searches and updates in bounded universes, PARENT QUERIES OVER DYNAMIC BALANCED PARENTHESIS STRINGS, Unnamed Item, Biased predecessor search, Integer priority queues with decrease key in constant time and the single source shortest paths problem, Dynamic interpolation search revisited, Unnamed Item, Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing, Approximating dynamic weighted vertex cover with soft capacities, A History of Distribution-Sensitive Data Structures, Improved Dynamic Graph Coloring, Unnamed Item, \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm, Adaptive succinctness, Computing the maximum exponent in a stream
