A mode of a multiset S is an element a∈ S of maximum multiplicity; that is, a occurs at least
as frequently as any other element in S. Given an array A 1: n of n elements, we consider a …

Many classic data structures have been proposed to support geometric queries, such as
range search, point location and nearest neighbor search. For a two-dimensional geometric …

Problems arising in diverse areas, such as VLSI layout design, database query-retrieval,
robotics, and computer graphics can often be formulated as geometric intersection …

We consider range queries in arrays that search for low-frequency elements: least frequent
elements and α-minorities. An α-minority of a query range has multiplicity no greater than an …

Given an array A of $ n $ elements, we wish to support queries for the most frequent and
least frequent element in a subrange $[l, r] $ of $ A $. We also wish to support updates that …

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 …

We revisit the random-access-machine model in which the input is given on a read-only
random-access media, the output is to be produced to a write-only sequential-access media …

A mode of a multiset S is an element a in S of maximum multiplicity; that is, a occurs at least
as frequently as any other element in S. Given an array A [1: n] of n elements, we consider a …

Karpinski and Nekrich (2008) introduced the problem of parameterized range majority,
which asks to preprocess a string of length n such that, given the endpoints of a range, one …

The problem of parameterized range majority asks us to preprocess a string of length n such
that, given the endpoints of a range, one can quickly find all the distinct elements whose …