Definition: When two or more items should be kept in the same location, especially in hash tables, that is, when two or more different keys hash to the same value.
See also collision resolution scheme, perfect hashing, simple uniform hashing.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "collision", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/collision.html