进一步统一细胞探针下限
Further Unifying the Landscape of Cell Probe Lower Bounds
摘要：
在一篇具有里程碑意义的论文中，Ptrajeccu演示了如何使用蝶形图中可达性的静态数据结构问题的单个下界，通过约简来导出大量新的和以前的下界。这些下限对于许多静态数据结构问题来说是严格的。此外，他还证明了蝴蝶图中的可达性简化为动态标记祖先，这是一个用于证明动态数据结构下界的经典问题。不幸的是，Pintrachecu对标记的祖先的简化丢失了$\lg \lg n$因子，因此不能完全恢复从标记的祖先遵循的所有先前的动态数据结构下限。在本文中，我们重新审视Ptrajeccu的工作，并给出了一个新的无损减少动态标记的祖先，从而建立在蝴蝶图的可达性作为一个单一的种子问题，从一系列紧密的静态和动态数据结构的下限如下。
英文摘要：
In a landmark paper, Pǎtraşcu demonstrated how a single lower bound for the static data structure problem of reachability in the butterfly graph, could be used to derive a wealth of new and previous lower bounds via reductions. These lower bounds are tight for numerous static data structure problems. Moreover, he also showed that reachability in the butterfly graph reduces to dynamic marked ancestor, a classic problem used to prove lower bounds for dynamic data structures. Unfortunately, Pǎtraşcu's reduction to marked ancestor loses a $\lg \lg n$ factor and therefore falls short of fully recovering all the previous dynamic data structure lower bounds that follow from marked ancestor. In this paper, we revisit Pǎtraşcu's work and give a new lossless reduction to dynamic marked ancestor, thereby establishing reachability in the butterfly graph as a single seed problem from which a range of tight static and dynamic data structure lower bounds follow.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
