Cell-probe lower bounds for dynamic problems via a new communication model

Cell-probe lower bounds for dynamic problems via a new communication model
复制标题

通过新的通信模型来探测动态问题的细胞探测下限

DOI:
10.1145/2897518.2897556
复制
发表时间:
2015
期刊:
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
影响因子:
--
通讯作者:
Huacheng Yu
Huacheng Yu
中科院分区:
--
文献类型:
--
作者:
Huacheng Yu

文献摘要

参考文献

被引文献

相似文献

在本文中,我们开发了一个新的通信模型,以证明一个数据结构下界的动态区间并问题。问题是维护[0,n]上具有整数坐标的区间I的多集,支持以下操作:1)插入(a,B),向I添加区间[a,B],前提是a和B是[0,n]中的整数; 2)删除(a,b),删除区间[a,b]。(现有的)interval [a,B]; 3)query(),返回I中所有interval的并集的总长度。它涉及到二维情况下的克利的措施问题。我们证明了在O(n)插入和删除的操作序列上存在一个分布,O(n0.01)查询,对于任何具有任何恒定错误概率的数据结构,期望需要Ω(nlogn)时间。有趣的是,我们使用Håstad和Wigderson的稀疏集不相交协议来加速一种新的不确定性通信游戏的简化,我们证明了它的下界。在应用方面,我们证明了几个动态图问题的下界,通过减少他们从动态区间并。
In this paper, we develop a new communication model to prove a data structure lower bound for the dynamic interval union problem. The problem is to maintain a multiset of intervals I over [0, n] with integer coordinates, supporting the following operations: 1) insert(a, b), add an interval [a, b] to I, provided that a and b are integers in [0, n]; 2) delete(a, b), delete an (existing) interval [a, b] from I; 3) query(), return the total length of the union of all intervals in I. It is related to the two-dimensional case of Klee’s measure problem. We prove that there is a distribution over sequences of operations with O(n) insertions and deletions, and O(n0.01) queries, for which any data structure with any constant error probability requires Ω(nlogn) time in expectation. Interestingly, we use the sparse set disjointness protocol of Håstad and Wigderson to speed up a reduction from a new kind of nondeterministic communication games, for which we prove lower bounds. For applications, we prove lower bounds for several dynamic graph problems by reducing them from dynamic interval union.
DOI: 10.1109/focs.2015.71
发表时间: 2015-04
期刊: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
影响因子: --
作者:
R. Clifford;A. Jørgensen;Kasper Green Larsen
通讯作者: R. Clifford;A. Jørgensen;Kasper Green Larsen
用于在线汉明距离计算的严格单元探针边界
DOI: 10.1137/1.9781611973105.48
发表时间: 2013
期刊: --
影响因子: --
作者:
Clifford R
通讯作者: Clifford R
DOI: 10.1137/16m1059369
发表时间: 2018
影响因子: 1.6
作者:
Göös, Mika;Pitassi, Toniann;Watson, Thomas
通讯作者: Watson, Thomas