The following pages link to Gerth Stølting Brodal (Q294927):
Displaying 50 items.
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- (Q494807) (redirect page) (← links)
- \(D^2\)-tree: a new overlay with deterministic bounds (Q494810) (← links)
- Towards optimal range medians (Q541663) (← links)
- Optimal sparse matrix dense vector multiplication in the I/O-model (Q613122) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878) (← links)
- A parallel priority queue with constant time operations (Q1130313) (← links)
- Comparator networks for binary heap construction (Q1589657) (← links)
- Fast allocation and deallocation with an improved buddy system (Q1772105) (← links)
- Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\) (Q1889603) (← links)
- A simple greedy algorithm for dynamic graph orientation (Q1986959) (← links)
- Fully persistent B-trees (Q2202015) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Q2437762) (← links)
- Integer representations towards efficient counting in the bit probe model (Q2447536) (← links)
- (Q2721968) (← links)
- (Q2722001) (← links)
- (Q2723969) (← links)
- (Q2847380) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters (Q2849297) (← links)
- The Encoding Complexity of Two Dimensional Range Minimum Data Structures (Q2849313) (← links)
- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm (Q2896387) (← links)
- (Q2904754) (← links)
- Two Dimensional Range Minimum Queries and Fibonacci Lattices (Q2912843) (← links)
- Integer Representations towards Efficient Counting in the Bit Probe Model (Q3010402) (← links)
- Dynamic Planar Range Maxima Queries (Q3012811) (← links)
- (Q3024792) (← links)
- (Q3024804) (← links)
- (Q3046473) (← links)
- D2-Tree: A New Overlay with Deterministic Bounds (Q3060756) (← links)
- A Cache-Oblivious Implicit Dictionary with the Working Set Property (Q3060759) (← links)
- (Q3129921) (← links)
- On external-memory MST, SSSP and multi-way planar graph separation (Q3159489) (← links)
- Fault Tolerant External Memory Algorithms (Q3183472) (← links)
- Expected Linear Time Sorting for Word Size Ω(log2 n loglogn) (Q3188879) (← links)
- Optimal Planar Orthogonal Skyline Counting Queries (Q3188886) (← links)
- Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time (Q3449808) (← links)
- Engineering a cache-oblivious sorting algorithm (Q3507783) (← links)
- Dynamic Matchings in Convex Bipartite Graphs (Q3525588) (← links)
- A Linear Time Algorithm for the k Maximal Sums Problem (Q3525591) (← links)
- Optimal Resilient Dynamic Dictionaries (Q3527225) (← links)
- On the limits of cache-obliviousness (Q3581248) (← links)
- Cache-oblivious string dictionaries (Q3581547) (← links)
- On Space Efficient Two Dimensional Range Minimum Data Structures (Q3586393) (← links)
- Selecting Sums in Arrays (Q3596710) (← links)
- The ComBack Method – Extending Hash Compaction with Backtracking (Q3612946) (← links)
