Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,376,271 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Computer science
Counter machine
Counter-machine model
Hamming distance
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
New Amortized Cell-Probe Lower Bounds for Dynamic Problems
Sayan Bhattacharya
,
Monika Henzinger
,
S. Neumann
Theoretical Computer Science
2019
Corpus ID: 59606321
2014
2014
Cell-probe bounds for online edit distance and other pattern matching problems
R. Clifford
,
Markus Jalsenius
,
Benjamin Sach
ACM-SIAM Symposium on Discrete Algorithms
2014
Corpus ID: 1582996
We give cell-probe bounds for the computation of edit distance, Hamming distance, convolution and longest common subsequence in a…
Expand
2013
2013
Efficient Range Reporting of Convex Hull
Jatin Agarwal
,
N. Moidu
,
Kishore Kothapalli
,
K. Srinathan
arXiv.org
2013
Corpus ID: 14850174
We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a…
Expand
Review
2013
Review
2013
Data Structures in Classical and Quantum Computing
M. Fillinger
arXiv.org
2013
Corpus ID: 18525275
This survey summarizes several results about quantum computing related to (mostly static) data structures. First, we describe…
Expand
Review
2013
Review
2013
A ug 2 01 3 Data Structures in Classical and Quantum Computing
Maximilian Fillinger August
2013
Corpus ID: 41287970
This survey summarizes several results about quantum computing related to (mostly static) data structures. First, we describe…
Expand
2012
2012
Tight Cell-Probe Bounds for Online Hamming Distance Computation
R. Clifford
,
Markus Jalsenius
,
Benjamin Sach
ACM-SIAM Symposium on Discrete Algorithms
2012
Corpus ID: 213114
We show tight bounds for online Hamming distance computation in the cell-probe model with word size w. The task is to output the…
Expand
2010
2010
Cell-Probe Proofs
Yitong Yin
TOCT
2010
Corpus ID: 19024886
We study the nondeterministic cell-probe complexity of static data structures. We introduce <i>cell-probe proofs</i> (CPP), a…
Expand
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…
Expand
Highly Cited
2005
Highly Cited
2005
Logarithmic Lower Bounds in the Cell-Probe Model
M. Patrascu
,
E. Demaine
SIAM journal on computing (Print)
2005
Corpus ID: 2202874
We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enables us to prove an…
Expand
1999
1999
Space Time Tradeoffs for Graph Properties
Y. Dodis
,
S. Khanna
International Colloquium on Automata, Languages…
1999
Corpus ID: 8932097
We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing power. Classically, space-time…
Expand
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)
ACCEPT & CONTINUE