Unifying the Landscape of Cell-Probe Lower Bounds

DOI10.1137/09075336XzbMath1226.68033DBLPjournals/siamcomp/Patrascu11arXiv1010.3783OpenAlexW2963834565WikidataQ60638783 ScholiaQ60638783MaRDI QIDQ3093625

Mihai Pǎtraşcu

Publication date: 18 October 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

data structureslower boundsrange queriescell-probe complexity

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (9)

Certifying equality with limited interaction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Shortest-path queries in static networks ⋮ Internal dictionary matching ⋮ Circular pattern matching with \(k\) mismatches ⋮ Upper and Lower Bounds on the Power of Advice ⋮ Reachability oracles for directed transmission graphs ⋮ Unnamed Item

This page was built for publication: Unifying the Landscape of Cell-Probe Lower Bounds