The algorithm for identical object searching with bounded worst-case complexity and linear memory

References

[1] Gasanov E. E., Lugovskaya Yu. P., “A constant, in the worst case, algorithm to search for identical objects”, Discrete Math. Appl., 9:6 (1999), 679–684.10.1515/dma.1999.9.6.679Search in Google Scholar

[2] Klykova N. V., Fast algorithms for fnding objects in the database, Degree thesis, MGU, 2001 (in Russian), 13 pp.Search in Google Scholar

[3] Gasanov E.E., “The solution to the problem of optimal synthesis of information graphs for background problems of information search”, Doklady Mathematics, 62:2 (2000), 304–305.Search in Google Scholar

[4] Gasanov E. E., Kudryavtsev V. B., The theory of information storage and retrieval, M.: Fizmatlit, 2002 (in Russian).Search in Google Scholar

[5] Gasanov E. E., The theory of information retrieval complexity, M.: Izd-vo MGU, 2005 (in Russian).Search in Google Scholar

[6] Knuth. D.E., The Art of Computer Programming. Volume 3. Sorting and searching, Addison-Wesley, 1973, 723 pp.Search in Google Scholar

[7] Borodin A. B., “Computational complexity — Theory and practice” (Current Trends in Theory of Computing), 1973, 35–89.Search in Google Scholar

[8] Bottenbruch H., “Structure and use of ALGOL 60”, J. ACM, 9 (1962), 161–221.10.2172/4020495Search in Google Scholar

[9] Dumey A., “Indexing for rapid random access memory systems”, Computers and Automation, 4:12 (1956), 6–9.Search in Google Scholar

[10] Hagerup T., “Fast deterministic construction of static dictionaries” (SODA’99 Proc. 10th Annu. ACM-SIAM Symp. Discrete algorithms), 1999, 414–418.Search in Google Scholar

[11] Hagerup T., Miltersen P. B., Pagh R., “Deterministic dictionaries”, J. Algorithms, 41:1 (2001), 69-85.10.1006/jagm.2001.1171Search in Google Scholar

[12] Hagerup T., “Simpler and faster dictionaries on the AC⁰ RAM”, ICALP, Lect. Notes Comput. Sci., 1443, Springer-Verlag, 1998, 79–90.10.1007/BFb0055042Search in Google Scholar

[13] Maurer W. D., Lewis T. G., “Hash table methods”, Computing Surveys, 7 (1975), 5–20.10.1145/356643.356645Search in Google Scholar

[14] Pletnev A. A., “The dynamic database allowing parallel processing of arbitrary stream queries”, Intellektual’nye sistemy, 19:1 (2014), 117–142 (in Russian).Search in Google Scholar

[15] Pletnev A. A., “Parallel processing by automaton of arbitrary stream queries to the dynamic database with logarithmic complexity”, Intellektual’nye sistemy, 19:1 (2014), 171–212 (in Russian).Search in Google Scholar

[16] Pletnev A. A., “The information-graph model of dynamic database and its application”, Intellektual’nye sistemy, 18:1 (2014),111–140 (in Russian).Search in Google Scholar

[17] Perper E. M., “Lower bounds of temporal and spatial complexity of the substring search problem”, Discrete Math. Appl., 24:6 (2014), 373–382.10.1515/dma-2014-0033Search in Google Scholar

[18] Gasanov E. E., Efremov D. V., “Background algorithm for solving two-dimensional domination problem”, Intellektual’nye sistemy, 18:3 (2014), 133–158 (in Russian).Search in Google Scholar

[19] Shutkin Yu. S., “Simulation of circuit control systems”, Intellektual’nye sistemy, 18:3 (2014), 253–261 (in Russian).Search in Google Scholar

[20] Perper E. M., “The order of complexity of the subword search problem in the set of words”, Intellektual’nye sistemy, 19:1 (2014), 99–116 (in Russian).Search in Google Scholar

[21] Il’in V.A., SadovnichiyV. A., Sendov Bl. Kh., Mathematical analysis. Continuation of the course / Ed. A.N.Tikhonova, M.: Izd-vo MGU, 1987 (in Russian), 358 pp.Search in Google Scholar