Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,399,329 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.
Review
2016
Review
2016
A Survey of Communication Complexity for Proving Lower Bound of Data Structures in Cell-Probe Model
2016
Corpus ID: 46417781
Proving lower bounds for computational problem is always a challenging work. In this survey, we will present some techniques for…
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
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
2013
2013
Mihai Pǎtraşcu: obituary and open problems
M. Thorup
SIGA
2013
Corpus ID: 4769356
Mihai Pǎtraşcu, aged 29, passed away on Tuesday June 5, 2012, after a 1.5 year battle with brain cancer. Mihai’s academic career…
Expand
2008
2008
Complexity of union-split-find problems
Katherine J. Lai
2008
Corpus ID: 60604423
In this thesis, we investigate various interpretations of the Union-Split-Find problem, an extension of the classic Union-Find…
Expand
2007
2007
Local Verifications in Distributed Data Structures
Yitong Yin
2007
Corpus ID: 18358430
We study distributed data structures, in which the results of queries to the data structure can be verified locally in a…
Expand
2003
2003
NEW LOWER BOUND TECHNIQUES FOR DYNAMIC PARTIAL SUMS AND RELATED PROBLEMS
C. SIAMJ.
2003
Corpus ID: 18133996
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic…
Expand
2003
2003
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
T. Husfeldt
,
Theis Rauhe
SIAM journal on computing (Print)
2003
Corpus ID: 32114963
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic…
Expand
1999
1999
Worst-case and amortised optimality in union-find (extended abstract)
Stephen Alstrup
,
Amir M. Ben-Amram
,
Theis Rauhe
Symposium on the Theory of Computing
1999
Corpus ID: 100111
We study the interplay between worst-case and amortised time bounds for the classic Disjoint Set Union problem (Union-Find). We…
Expand
1999
1999
Space-time Tradeoos for Graph Properties
Y. Dodis
,
Sanjeev Khannay
1999
Corpus ID: 10817440
We initiate a study of space-time tradeoos in the cell-probe model under restricted preprocessing power. In this setup, we are…
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