Pages that link to "Item:Q1869935"

The following pages link to Optimal bounds for the predecessor problem and related problems (Q1869935):

Displaying 34 items.

• Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
• Succinct encoding of arbitrary graphs (Q391972) (← links)
• Towards optimal range medians (Q541663) (← links)
• Fast local searches and updates in bounded universes (Q691776) (← links)
• Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
• Biased predecessor search (Q727976) (← links)
• A compressed dynamic self-index for highly repetitive text collections (Q776840) (← links)
• Adjacency queries in dynamic sparse graphs (Q846004) (← links)
• A note on predecessor searching in the pointer machine model (Q989469) (← links)
• Dynamic nested brackets (Q1882928) (← links)
• Improved bounds for finger search on a RAM (Q1950391) (← links)
• Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
• Two-dimensional packet classification and filter conflict resolution in the internet (Q2272209) (← links)
• Dynamic interpolation search revisited (Q2288214) (← links)
• Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
• Maximal common subsequence algorithms (Q2326405) (← links)
• Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
• The cell probe complexity of succinct data structures (Q2373728) (← links)
• A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
• Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem (Q2466000) (← links)
• Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
• Minimal indices for predecessor search (Q2514143) (← links)
• c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← 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)
• Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
• Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)
• (Q5088897) (← links)
• (Q5091256) (← links)
• (Q5121915) (← links)
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
• Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)