Pages that link to "Item:Q797269"
From MaRDI portal
The following pages link to The design of dynamic data structures (Q797269):
Displaying 39 items.
- Optimizing binary heaps (Q2411045) (← links)
- Red-black trees with constant update time (Q2422774) (← links)
- Straight-path queries in trajectory data (Q2634714) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures (Q3000523) (← links)
- (Q3122732) (← links)
- Resolving SINR Queries in a Dynamic Setting (Q3387759) (← links)
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY (Q3421856) (← links)
- Reliable Resource Searching in P2P Networks (Q3556635) (← links)
- DESIGN METHODOLOGY OF BOUNDARY DATA STRUCTURES (Q3987059) (← links)
- (Q3990112) (← links)
- Using persistent data structures for adding range restrictions to searching problems (Q4362274) (← links)
- Updating approximately complete trees (Q4365019) (← links)
- Efficient splitting and merging algorithms for order decomposable problems (Q4571990) (← links)
- Dynamic interpolation search in o(log log n) time (Q4630245) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- (Q4778577) (← links)
- Priority Queues and Sorting for Read-Only Data (Q4922111) (← links)
- (Q5002834) (← links)
- Predecessor queries in dynamic integer sets (Q5047156) (← links)
- Binary search trees: How low can you go? (Q5054833) (← links)
- Verified Root-Balanced Trees (Q5056001) (← links)
- Dynamic partition trees (Q5056121) (← links)
- Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
- Dynamic algorithms for the Dyck languages (Q5057425) (← links)
- A dynamic separator algorithm (Q5060105) (← links)
- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) (Q5060121) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- (Q5088951) (← links)
- Concatenable segment trees (Q5096181) (← links)
- Dynamic planar orthogonal point location in sublogarithmic time (Q5115793) (← links)
- FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES (Q5299999) (← links)
- Approximate Range Searching in External Memory (Q5387785) (← links)
- Data structures with dynamical random transitions (Q5486321) (← links)
- (Q5743403) (← links)
- Many distances in planar graphs (Q5920250) (← links)
- (Q6060104) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)
- Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)
