Cell-probe lower bounds for dynamic problems via a new communication model
From MaRDI portal
Publication:5361844
DOI10.1145/2897518.2897556zbMath1373.68201arXiv1512.01293OpenAlexW2265973210MaRDI QIDQ5361844
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (3)
New amortized cell-probe lower bounds for dynamic problems ⋮ Efficient representation and counting of antipower factors in words ⋮ Unnamed Item
This page was built for publication: Cell-probe lower bounds for dynamic problems via a new communication model
