Skip to search formSkip to main contentSkip to account menu

Cell-probe model

In computer science, the cell-probe model is a model of computation similar to the Random-access machine, except that all operations are free except… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Computer scienceCounter machineCounter-machine modelHamming distance

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
New Amortized Cell-Probe Lower Bounds for Dynamic Problems
2018
2018
Optimal Substring Equality Queries with Applications to Sparse Text Indexing
  • N. Prezza
  • ACM Trans. Algorithms
  • 2018
  • Corpus ID: 3672682
We consider the problem of encoding a string of length n from an integer alphabet of size σ so access, substring equality, and… 
2016
2016
Tight lower bounds for the longest common extension problem
  • D. Kosolobov
  • Information Processing Letters
  • 2016
  • Corpus ID: 5693834
Review
2013
Review
2013
A ug 2 01 3 Data Structures in Classical and Quantum Computing
This survey summarizes several results about quantum computing related to (mostly static) data structures. First, we describe… 
Review
2013
Review
2013
Data Structures in Classical and Quantum Computing
This survey summarizes several results about quantum computing related to (mostly static) data structures. First, we describe… 
2012
2012
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
  • Elad VerbinWei Yu
  • Annual Symposium on Combinatorial Pattern…
  • 2012
  • Corpus ID: 17988827
In this paper we investigate the problem of building a static data structure that represents a string s using space close to its… 
2010
2010
Cell-Probe Proofs
We study the nondeterministic cell-probe complexity of static data structures. We introduce <i>cell-probe proofs</i> (CPP), a… 
2008
2008
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity
  • Yitong Yin
  • International Colloquium on Automata, Languages…
  • 2008
  • Corpus ID: 6556607
We study the nondeterministic cell-probe complexity of static data structures. We introduce cell-probe proofs (CPP), a proof… 
Highly Cited
2005
Highly Cited
2005
Logarithmic Lower Bounds in the Cell-Probe Model
We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enables us to prove an… 
2003
2003
Cell-probe lower bounds for the partial match problem
Given a database of n points in (0,1)d, the partial match problem is: In response to a query x in (0, 1, *)d, find a database… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)