Pages that link to "Item:Q794438"

The following pages link to New trie data structures which support very fast search operations (Q794438):

Displaying 18 items.

• An old sub-quadratic algorithm for finding extremal sets (Q287109) (← links)
• Approximate covering detection among content-based subscriptions using space filling curves (Q362593) (← links)
• Palindrome pattern matching (Q390901) (← links)
• Improved behaviour of tries by adaptive branching (Q685503) (← links)
• Range-restricted mergeable priority queues (Q689640) (← links)
• Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
• Scanline algorithms on a grid (Q1111020) (← links)
• An improved scheme for set equality testing and updating (Q1129006) (← links)
• A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time (Q1187029) (← links)
• Finding extremal sets in less than quadratic time (Q1313720) (← links)
• Surpassing the information theoretic bound with fusion trees (Q1317486) (← links)
• Parallel processing can be harmful: The unusual behavior of interpolation search (Q1825662) (← links)
• Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333) (← links)
• Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
• Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
• Ranking intervals under visibility constraints^∗ (Q3477956) (← links)
• Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space (Q5458854) (← links)