Pages that link to "Item:Q3546335"
From MaRDI portal
The following pages link to Dynamic ordered sets with exponential search trees (Q3546335):
Displaying 32 items.
- Order-preserving indexing (Q294954) (← links)
- Dynamic range majority data structures (Q306716) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- Biased predecessor search (Q727976) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- New method in information processing for maintaining an efficient dynamic ordered set (Q848256) (← links)
- Improved bounds for finger search on a RAM (Q1950391) (← links)
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Computing the maximum exponent in a stream (Q2118207) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Q2437762) (← links)
- Online binary minimax trees (Q2444549) (← links)
- New algorithms for binary jumbled pattern matching (Q2444765) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- A History of Distribution-Sensitive Data Structures (Q2848972) (← links)
- Alphabet-Dependent String Searching with Wexponential Search Trees (Q2942254) (← links)
- Algorithms in the Ultra-Wide Word Model (Q2948478) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- Worst-Case Optimal Adaptive Prefix Coding (Q3183465) (← links)
- (Q5009521) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- (Q5091256) (← links)
- (Q5115793) (← links)
- PARENT QUERIES OVER DYNAMIC BALANCED PARENTHESIS STRINGS (Q5168423) (← links)
- (Q5743458) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- Integer priority queues with decrease key in constant time and the single source shortest paths problem (Q5917573) (← links)
