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
期刊:
影响因子:
--
通讯作者:
Huacheng Yu
中科院分区:
文献类型:
--
作者:
Huacheng Yu
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
影响因子:
1.6
作者:
Göös, Mika;Pitassi, Toniann;Watson, Thomas
通讯作者:
Watson, Thomas