
Hypersuccinct Trees – New universal tree source codes for optimal compressed tree data structures
We present a new universal source code for unlabeled binary and ordinal ...
read it

Lazy Search Trees
We introduce the lazy search tree data structure. The lazy search tree i...
read it

Succinct Permutation Graphs
We present a succinct, i.e., asymptotically spaceoptimal, data structur...
read it

BreadthFirst Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs
We present the first succinct data structure for ordinal trees that supp...
read it

Dynamic Optimality Refuted  For Tournament Heaps
We prove a separation between offline and online algorithms for fingerb...
read it

Efficient SecondOrder ShapeConstrained Function Fitting
We give an algorithm to compute a onedimensional shapeconstrained func...
read it

Entropy Trees and RangeMinimum Queries In Optimal AverageCase Space
The rangeminimum query (RMQ) problem is a fundamental data structuring ...
read it

QuickXsort  A Fast Sorting Scheme in Theory and Practice
QuickXsort is a highly efficient inplace sequential sorting scheme that...
read it

Sesquickselect: One and a half pivots for cacheefficient selection
Because of unmatched improvements in CPU performance, memory transfers h...
read it

NearlyOptimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs
We present two stable mergesort variants, "peeksort" and "powersort", th...
read it

Pivot Sampling in QuickXSort: Precise Analysis of QuickMergesort and QuickHeapsort
QuickXSort is a strategy to combine Quicksort with another sorting metho...
read it
Sebastian Wild
is this you? claim profile