Bryce Sandlund

activity

20162026

most citedSelectable Heaps and Optimal Lazy Search Trees

1 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

cs.DS2020★ 1 cited

Selectable Heaps and Optimal Lazy Search Trees

Bryce Sandlund, Lingyi Zhang

We show the $O (lo g n)$ time extract minimum function of efficient priority queues can be generalized to the extraction of the $k$ smallest elements in $O (k lo g (n / k))$ time (we de…

cs.DS2020

Lazy Search Trees

Bryce Sandlund, Sebastian Wild

We introduce the lazy search tree data structure. The lazy search tree is a comparison-based data structure on the pointer machine that supports order-based operations such as rank…

cs.DS2020★ 1 cited

Faster Dynamic Range Mode

Bryce Sandlund, Yinzhan Xu

In the dynamic range mode problem, we are given a sequence $a$ of length bounded by $N$ and asked to support element insertion, deletion, and queries for the most frequent element…