1 citations · 1 across the 1 of their papers we have counts for
7 papers
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…
Faster Dynamic Range Mode
Bryce Sandlund, Yinzhan Xu
In the dynamic range mode problem, we are given a sequence of length bounded by and asked to support element insertion, deletion, and queries for the most frequent element…
A Simple Algorithm for Minimum Cuts in Near-Linear Time
Nalin Bhardwaj, Antonio Molina Lovett, Bryce Sandlund
We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that -respects (cuts two edges of) a spanning tree of a…
On Approximate Range Mode and Range Selection
Hicham El-Zein, Meng He, J. Ian Munro +2
For any , a -approximate range mode query asks for the position of an element whose frequency in the query range is at most a factor smaller than the tru…
Space-Efficient Data Structures for Lattices
J. Ian Munro, Bryce Sandlund, Corwin Sinnamon
A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for latti…
On Euclidean Methods for Cubic and Quartic Jacobi Symbols
Eric Bach, Bryce Sandlund
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures…