The following pages link to Gerth Stølting Brodal (Q294927):
Displaying 17 items.
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← 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)
- Fast allocation and deallocation with an improved buddy system (Q1772105) (← links)
- Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time (Q3449808) (← links)
- Algorithm Theory - SWAT 2004 (Q5315374) (← links)
- Algorithm Theory - SWAT 2004 (Q5315399) (← links)
- Strict fibonacci heaps (Q5415543) (← links)
- Purely Functional Worst Case Constant Time Catenable Sorted Lists (Q5449526) (← links)
- Priority queues with decreasing keys (Q6495789) (← links)
- External memory fully persistent search trees (Q6499312) (← links)
