Cell-probe model
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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 memory access. This model is useful for proving lower bounds of algorithms for data structure problems.
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 memory access. This model is useful for proving lower bounds of algorithms for data structure problems. Improving on a result of Fredman and Saks, Mihai Pătraşcu used the cell-probe model and an information transfer argument to show that the partial sums problem requires \Omega\left(\log n\right) time per operation in the worst case (i.e., the worst of query and update must consume such time), assuming b=\Omega(\log n) bits per word. He further exhibited the trade-off curve between update time and query time and investigated the case that updates are restricted to small numbers (of \delta=o(b) bits).
Notes
Citations
Text derived from https://en.wikipedia.org/w/index.php?oldid=1323298765 under CC BY-SA 4.0; modifications have been made.