Faster Dynamic Range Mode

04/19/2020
by   Bryce Sandlund, et al.
0

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 of a contiguous subsequence of a. In this work, we devise a deterministic data structure that handles each operation in worst-case Õ(N^0.655994) time, thus breaking the O(N^2/3) per-operation time barrier for this problem. The data structure is achieved by combining the ideas in Williams and Xu (SODA 2020) for batch range mode with a novel data structure variant of the Min-Plus product.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
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
03/09/2021

Dynamic Range Mode Enumeration

The range mode problem is a fundamental problem and there is a lot of wo...
research
02/28/2019

Dynamic Planar Convex Hull

In this article, we determine the amortized computational complexity of ...
research
09/20/2021

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees

We study the problem of designing a resilient data structure maintaining...
research
06/01/2020

Note to "An efficient Data Structure for Lattice Operation"

This note is to publicly answer to a paper recently accepted to SWAT 202...
research
03/29/2021

A Novel Conversion Technique from Nodal to Edge Finite Element Data Structure for Electromagnetic Analysis

Standard nodal finite elements in electromagnetic analysis have well-kno...

Please sign up or login with your details

Forgot password? Click here to reset