Gasanov Èlyar Èldarovich

Publications in Math-Net.Ru

1. The use of language models in automated markup of texts on life dificulties
   
   Intelligent systems. Theory and applications, 29:3 (2025),  53–75
2. Convergence of the automata model of baroreceptor complex
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2025, no. 6,  3–8
3. Fast algorithms for multiplication and division of natural numbers using cellular automata with locators
   
   Intelligent systems. Theory and applications, 28:3 (2024),  103–130
4. MaTIS – the school of V.B. Kudryavtsev: traditions and advancement
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2024, no. 6,  15–26
5. Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2023, no. 5,  33–39
6. On a new algorithm for reaching consensus for stablecoins
   
   Intelligent systems. Theory and applications, 26:1 (2022),  94–100
7. Implementation of key-value databases by cellular automata with locators
   
   Intelligent systems. Theory and applications, 25:5 (2021),  79–82
8. Cellular automata with locators
   
   Intelligent systems. Theory and applications, 25:5 (2021),  15–26
9. Implementation of key-value databases by cellular automata with locators
   
   Intelligent systems. Theory and applications, 25:4 (2021),  108–112
10. Celluar automata with locators
    
    Intelligent systems. Theory and applications, 24:2 (2020),  119–132
11. Construction of multi-colored images by cell automata
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2020, no. 2,  22–27
12. On stabilization of an automaton model of migration processes
    
    Diskr. Mat., 31:1 (2019),  56–71
13. On the semantic analysis of juridical documents
    
    Intelligent systems. Theory and applications, 22:3 (2018),  45–88
14. On the functional complexity of the two-dimensional domination problem
    
    Intelligent systems. Theory and applications, 21:4 (2017),  102–114
15. The algorithm for identical object searching with bounded worst-case complexity and linear memory
    
    Diskr. Mat., 28:2 (2016),  3–11
16. Моделирование динамических баз данных
    
    Intelligent systems. Theory and applications, 20:3 (2016),  146–150
17. Hardware implementation of on-the-fly reconfigurable BCH decoder
    
    Intelligent systems. Theory and applications, 20:2 (2016),  53–66
18. Prediction of general regular superevents by automata
    
    Intelligent systems. Theory and applications, 19:3 (2015),  127–154
19. Information storage and search complexity theory
    
    Fundam. Prikl. Mat., 15:3 (2009),  49–73
20. On the automaton determinization of sets of superworks
    
    Diskr. Mat., 18:2 (2006),  84–97
21. A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem
    
    Diskr. Mat., 16:4 (2004),  49–64
22. On the functional complexity of a two-dimensional interval search problem
    
    Diskr. Mat., 14:1 (2002),  114–141
23. Estimates for the complexity of a method for solving the problem of inclusive search
    
    Diskr. Mat., 12:2 (2000),  118–139
24. A constant, in the worst case, algorithm for the search for identical objects
    
    Diskr. Mat., 11:4 (1999),  139–144
25. Modeling and search complexity in multiprocessor systems
    
    Diskr. Mat., 11:3 (1999),  63–82
26. A lower bound for the complexity of inclusive search in the class of tree-like circuits
    
    Diskr. Mat., 10:1 (1998),  63–72
27. On one mathematical model of the background search algorithms and the quick algorithm for the two-dimensional domination problem
    
    Fundam. Prikl. Mat., 3:3 (1997),  759–773
28. A lower bound for the complexity of information networks for a partial ordering relation
    
    Diskr. Mat., 8:4 (1996),  108–122
29. Instantaneously solvable search problems
    
    Diskr. Mat., 8:3 (1996),  119–134
30. On a one-dimensional problem of interval search
    
    Diskr. Mat., 7:2 (1995),  40–60
31. Some instantly solvable in average search problems
    
    Fundam. Prikl. Mat., 1:1 (1995),  123–146
32. A lower bound on the complexity of information networks for a class of information search problems
    
    Diskr. Mat., 4:3 (1992),  118–127
33. On a mathematical information search mode
    
    Diskr. Mat., 3:2 (1991),  69–76


34. About the scientific school of Valery Borisovich Kudryavtsev
    
    Intelligent systems. Theory and applications, 25:4 (2021),  19–27