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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
  • 2016
  • Corpus ID: 46417781
Proving lower bounds for computational problem is always a challenging work. In this survey, we will present some techniques for… 
2013
2013
We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a… 
Review
2013
Review
2013
This survey summarizes several results about quantum computing related to (mostly static) data structures. First, we describe… 
2013
2013
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… 
2008
2008
In this thesis, we investigate various interpretations of the Union-Split-Find problem, an extension of the classic Union-Find… 
2007
2007
We study distributed data structures, in which the results of queries to the data structure can be verified locally in a… 
2003
2003
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic… 
2003
2003
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic… 
1999
1999
We study the interplay between worst-case and amortised time bounds for the classic Disjoint Set Union problem (Union-Find). We… 
1999
1999
We initiate a study of space-time tradeoos in the cell-probe model under restricted preprocessing power. In this setup, we are…