The following pages link to Making data structures persistent (Q1117690):
Displayed 45 items.
- Multiple matching of parameterized patterns (Q672748) (← links)
- Maintaining dynamic sequences under equality tests in polylogarithmic time (Q675314) (← links)
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- Dynamic state restoration using versioning exceptions (Q853735) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Time-varying Reeb graphs for continuous space-time data (Q945940) (← links)
- A dynamic data structure for top-\(k\) queries on uncertain data (Q955007) (← links)
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines (Q1041794) (← links)
- A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
- Making data structures persistent (Q1117690) (← links)
- Space reduction and an extension for a hidden line elimination algorithm (Q1126253) (← links)
- Unifications, deunifications, and their complexity (Q1173920) (← links)
- Worst-case data structures for the priority queue with attrition (Q1262119) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- Speeding up dynamic transitive closure for bounded degree graphs (Q1323330) (← links)
- A constant update time finger search tree (Q1338781) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- The space-optimal version of a known rectangle enclosure reporting algorithm (Q1391959) (← links)
- Indexing moving points (Q1394801) (← links)
- Translating a regular grid over a point set (Q1873153) (← links)
- Parallel algorithms for arrangements (Q1907232) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041) (← links)
- Queries on Voronoi diagrams on moving points (Q1924716) (← links)
- Two-dimensional packet classification and filter conflict resolution in the internet (Q2272209) (← links)
- Sequential vector packing (Q2378514) (← links)
- Improved output-sensitive snap rounding (Q2482192) (← links)
- Lower and upper bounds on obtaining history independence (Q2490116) (← links)
- Exponentially decreasing number of operations in balanced trees (Q2576662) (← links)
- Algorithms for three-dimensional dominance searching in linear space. (Q2583568) (← links)
- A partially persistent data structure for the set-union problem (Q3479514) (← links)
- Confluently Persistent Tries for Efficient Version Control (Q3512456) (← links)
- New Data Structures for IP Lookup and Conflict Detection (Q3637325) (← links)
- Some Results for Elementary Operations (Q3644718) (← links)
- Isocontour based Visualization of Time-varying Scalar Fields (Q3651655) (← links)
- Optimal purely functional priority queues (Q4339017) (← links)
- Using persistent data structures for adding range restrictions to searching problems (Q4362274) (← links)
- (Q4488857) (← links)
- INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS (Q4682199) (← links)
- Dynamic Structures for Top-k Queries on Uncertain Data (Q5387776) (← links)
- I/O-efficient point location using persistent B-trees (Q5463442) (← links)
- Optimal finger search trees in the pointer machine (Q5917584) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q5970603) (← links)