arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.08777cs.DS
收藏

更快的动态范围模式

Faster Dynamic Range Mode

Bryce Sandlund, Yinzhan Xu

摘要:

在动态范围模式的问题,我们给出了一个序列$a$的长度由$N$界定,并要求支持元素插入,删除,和查询的最频繁的元素的连续子序列的$a$。在这项工作中,我们设计了一个确定性的数据结构,在最坏情况下的$\tilde{O}(N^{0.655994})$时间处理每个操作,从而打破了$O(N^{2/3})$每操作的时间障碍,这个问题。数据结构是通过将Williams和Xu(SODA 2020)中用于批量范围模式的思想与Min-Plus产品的新型数据结构变体相结合来实现的。

英文摘要:

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 $\tilde{O}(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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑