The following pages link to Making data structures persistent (Q1117690):
Displaying 50 items.
- Sparse dominance queries for many points in optimal time and space (Q293151) (← links)
- Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Spiderman graph: visibility in urban regions (Q482349) (← links)
- Linear-space data structures for range minority query in arrays (Q494786) (← links)
- Detecting regular visit patterns (Q547297) (← links)
- Multiple matching of parameterized patterns (Q672748) (← links)
- Maintaining dynamic sequences under equality tests in polylogarithmic time (Q675314) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- Dynamic state restoration using versioning exceptions (Q853735) (← links)
- Range queries on uncertain data (Q897858) (← 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)
- Confluently persistent tries for efficient version control (Q970608) (← links)
- Largest empty circle centered on a query line (Q972354) (← links)
- Approximating nearest neighbor among triangles in convex position (Q975498) (← 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)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← 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)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Online machine learning techniques for Coq: a comparison (Q2128797) (← links)
- String indexing for top-\(k\) close consecutive occurrences (Q2163391) (← links)
- Finding pairwise intersections of rectangles in a query rectangle (Q2175440) (← links)
- Fully persistent B-trees (Q2202015) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- Computing homotopic line simplification (Q2249045) (← links)
