Pages that link to "Item:Q579942"

The following pages link to An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time (Q579942):

Displayed 22 items.

• On compressing and indexing repetitive sequences (Q390894) ‎ (← links)
• Space-efficient data-analysis queries on grids (Q390915) ‎ (← links)
• A distribution-sensitive dictionary with low space overhead (Q414433) ‎ (← links)
• A quick tour on suffix arrays and compressed suffix arrays (Q544881) ‎ (← links)
• Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) ‎ (← links)
• A bounded-space tree traversal algorithm (Q689629) ‎ (← links)
• In-place algorithms for computing (Layers of) maxima (Q848632) ‎ (← links)
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) ‎ (← links)
• A pointer-free data structure for merging heaps and min-max heaps (Q1177934) ‎ (← links)
• A path integral approach to data structure evolution (Q1179455) ‎ (← links)
• An implicit data structure for searching a multikey table in logarithmic time (Q1186547) ‎ (← links)
• Sorting multisets stably in minimum space (Q1338888) ‎ (← links)
• Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) ‎ (← links)
• A tradeoff between search and update in dictionaries (Q1607123) ‎ (← links)
• An efficient implicit data structure for relation testing and searching in partially ordered sets (Q2366649) ‎ (← links)
• Line-segment intersection made in-place (Q2385700) ‎ (← links)
• Fully Functional Static and Dynamic Succinct Trees (Q2799480) ‎ (← links)
• Computing (and Life) Is All about Tradeoffs (Q2848971) ‎ (← links)
• A Survey on Priority Queues (Q2848973) ‎ (← links)
• Succinct and Implicit Data Structures for Computational Geometry (Q2848977) ‎ (← links)
• A Distribution-Sensitive Dictionary with Low Space Overhead (Q3183445) ‎ (← links)
• Representing graphs implicitly using almost optimal space (Q5928875) ‎ (← links)