Unifying the Landscape of Cell-Probe Lower Bounds

We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for:

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Mihai Patrascu
• Keywords: CORR 2010, Data-structure Lower Bounds, Education, Lower Bounds, Space Lower Bounds