Pages that link to "Item:Q1162362"
From MaRDI portal
The following pages link to A new data structure for representing sorted lists (Q1162362):
Displaying 40 items.
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Maintaining order in a generalized linked list (Q1052093) (← links)
- Optimal multiway search trees for variable size keys (Q1053461) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- A balanced search tree O(1) worst-case update time (Q1114387) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- Making data structures persistent (Q1117690) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- A constant update time finger search tree (Q1338781) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q1384535) (← links)
- Relaxed multi-way trees with group updates. (Q1401964) (← links)
- Updating a balanced search tree in 0(1) rotations (Q1838042) (← links)
- On the existence and construction of non-extreme \((a,b)\)-trees. (Q1853114) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Fully persistent B-trees (Q2202015) (← links)
- Towards a real time algorithm for parameterized longest common prefix computation (Q2220836) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Red-black trees with constant update time (Q2422774) (← links)
- Improved output-sensitive snap rounding (Q2482192) (← links)
- Exponentially decreasing number of operations in balanced trees (Q2576662) (← links)
- Deletion without rebalancing in multiway search trees (Q2943570) (← links)
- Dynamic Planar Range Maxima Queries (Q3012811) (← links)
- Some Results for Elementary Operations (Q3644718) (← links)
- Amortized Computational Complexity (Q3735083) (← links)
- Predecessor queries in dynamic integer sets (Q5047156) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q5057441) (← links)
- The buffer tree: A new technique for optimal I/O-algorithms (Q5057446) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- (Q5111728) (← links)
- VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE (Q5249272) (← links)
- I/O-efficient point location using persistent B-trees (Q5463442) (← links)
- (Q5743424) (← links)
- Optimal finger search trees in the pointer machine (Q5917584) (← links)
- External memory planar point location with logarithmic updates (Q5920252) (← links)
- AVL trees with relaxed balance (Q5929917) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- (Q6065430) (← links)
