Definition: A model of computation where the cost of a computation is measured by the total number of memory accesses to a random access memory with ⌈log n⌉ bits cell size. All other computations are not counted and are considered to be free.
See also random access machine, pointer machine, Turing machine, big-O notation.
Note: From Algorithms and Theory of Computation Handbook, page 5-24, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon Mar 5 14:59:20 2018.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "cell probe model", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/cellProbeModel.html