The following pages link to Lars Arge (Q247165):
Displaying 50 items.
- (Approximate) uncertain skylines (Q359874) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- External-memory algorithms for processing line segments in geographic information systems (Q868436) (← links)
- Cache-oblivious R-trees (Q1017905) (← links)
- Indexing moving points (Q1394801) (← links)
- The buffer tree: A technique for designing batched external data structures (Q1424247) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- Efficient bulk operations on dynamic \(R\)-trees (Q1601035) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Efficient external memory structures for range-aggregate queries (Q1931282) (← links)
- (Q2722001) (← links)
- (Q2722002) (← links)
- On (Dynamic) Range Minimum Queries in External Memory (Q2842141) (← links)
- An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters (Q2849297) (← links)
- RAM-Efficient External Memory Sorting (Q2872113) (← links)
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model (Q2874593) (← links)
- An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries (Q2884577) (← links)
- Simplifying Massive Contour Maps (Q2912830) (← links)
- (Q2921744) (← links)
- On external-memory MST, SSSP and multi-way planar graph separation (Q3159489) (← links)
- I/O-efficient batched union-find and its applications to terrain analysis (Q3188993) (← links)
- Cache-Oblivious Red-Blue Line Segment Intersection (Q3541077) (← links)
- Cache-oblivious priority queue and graph algorithm applications (Q3579229) (← links)
- (Q3601535) (← links)
- (Q3601536) (← links)
- The ComBack Method – Extending Hash Compaction with Backtracking (Q3612946) (← links)
- I/O-Efficient Contour Tree Simplification (Q3652300) (← links)
- (Q4250172) (← links)
- (Q4250238) (← links)
- (Q4252266) (← links)
- (Q4411348) (← links)
- (Q4414531) (← links)
- Optimal External Memory Interval Management (Q4429699) (← links)
- On External-Memory Planar Depth First Search (Q4435346) (← links)
- (Q4490352) (← links)
- (Q4527021) (← links)
- (Q4535014) (← links)
- (Q4552048) (← links)
- (Q4643861) (← links)
- Computing and Combinatorics (Q4681163) (← links)
- (Q4778542) (← links)
- (Q4778580) (← links)
- (Q4796163) (← links)
- (Q4945529) (← links)
- The priority R-tree (Q4962701) (← links)
- The buffer tree: A new technique for optimal I/O-algorithms (Q5057446) (← links)
- A general lower bound on the I/O-complexity of comparison-based algorithms (Q5060102) (← links)
- (Q5115770) (← links)
- Orthogonal Range Reporting in Three and Higher Dimensions (Q5171171) (← links)
- Skip-webs (Q5177225) (← links)
