|
This article is cited in 2 scientific papers (total in 2 papers)
A constant, in the worst case, algorithm for the search for identical objects
È. È. Gasanov, Yu. P. Lugovskaya
Abstract:
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.
Received: 16.10.1998 Revised: 22.07.1999
Citation:
È. È. Gasanov, Yu. P. Lugovskaya, “A constant, in the worst case, algorithm for the search for identical objects”, Diskr. Mat., 11:4 (1999), 139–144; Discrete Math. Appl., 9:6 (1999), 679–684
Linking options:
https://www.mathnet.ru/eng/dm396https://doi.org/10.4213/dm396 https://www.mathnet.ru/eng/dm/v11/i4/p139
|
Statistics & downloads: |
Abstract page: | 411 | Full-text PDF : | 190 | First page: | 1 |
|