research
∙
10/17/2020
Lazy Search Trees
We introduce the lazy search tree data structure. The lazy search tree i...
share
research
∙
04/19/2020
Faster Dynamic Range Mode
In the dynamic range mode problem, we are given a sequence a of length b...
research
∙
08/30/2019
A Simple Algorithm for Minimum Cuts in Near-Linear Time
We consider the minimum cut problem in undirected, weighted graphs. We g...
research
∙
07/19/2019
On Approximate Range Mode and Range Selection
For any ϵ∈ (0,1), a (1+ϵ)-approximate range mode query asks for the posi...
research
∙
02/13/2019
Space-Efficient Data Structures for Lattices
A lattice is a partially-ordered set in which every pair of elements has...
research
∙
07/20/2018
On Euclidean Methods for Cubic and Quartic Jacobi Symbols
We study the bit complexity of two methods, related to the Euclidean alg...
research
∙
07/10/2018
Improved Time and Space Bounds for Dynamic Range Mode
Given an array A of n elements, we wish to support queries for the most ...
research
∙
12/11/2016
