A constant, in the worst case, algorithm for the search for identical objects

We suggest an algorithm to search for identical objects, which, using a memory of volume of order $k^2$, almost always performs searching over a set of cardinality $k$ in six elementary operations in the worst case.
The research was supported by the Russian Foundation for Basic Research, grant 98–01–00130.