We introduce the lazy search tree data structure. The lazy search tree i...
In the dynamic range mode problem, we are given a sequence a of length
b...
We consider the minimum cut problem in undirected, weighted graphs. We g...
For any ϵ∈ (0,1), a (1+ϵ)-approximate range mode query
asks for the posi...
A lattice is a partially-ordered set in which every pair of elements has...
We study the bit complexity of two methods, related to the Euclidean
alg...
Given an array A of n elements, we wish to support queries for the most
...
We study discrete logarithms in the setting of group actions. Suppose th...