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

DOI10.1145/2897518.2897556MaRDI QIDQ5361844zbMATH OpenOpenAlexFDO

Authors Huacheng Yu

Publication date 29 September 2017

Published in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.01293

zbMATH Keywords

cell-probe modelKlee's measure problemlower bound

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: 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 $mathcalI$ over $[0,n]$ with integer coordinates, supporting the following operations: - insert(a, b): add an interval $[a,b]$ to $mathcalI$, provided that $a$ and $b$ are integers in $[0,n]$; - delete(a, b): delete a (previously inserted) interval $[a,b]$ from $mathcalI$; - query(): return the total length of the union of all intervals in $mathcalI$. 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(n^{0.01})$ queries, for which any data structure with any constant error probability requires $Omega(nlogn)$ time in expectation. Interestingly, we use the sparse set disjointness protocol of Haa{}stad and Wigderson [ToC'07] 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.

Recommendations

• Cell-probe lower bounds from online communication complexity
• Logarithmic Lower Bounds in the Cell-Probe Model
• Lower bounds for dynamic connectivity
• Towards polynomial lower bounds for dynamic problems
• The cell probe complexity of dynamic range counting

Cited in

(6)

• New amortized cell-probe lower bounds for dynamic problems
• Towards polynomial lower bounds for dynamic problems
• Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
• Unifying the landscape of cell-probe lower bounds
• scientific article; zbMATH DE number 7250167 (Why is no real title available?)
• Cell-probe lower bounds from online communication complexity

This page was built for publication: Cell-probe lower bounds for dynamic problems via a new communication model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361844)