RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Gasanov, Èlyar Èldarovich

Statistics Math-Net.Ru
Total publications: 21
Scientific articles: 21

Number of views:
This page:1577
Abstract pages:4280
Full texts:1785
References:236
Professor
Doctor of physico-mathematical sciences (1999)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 14.11.1959
Phone: +7 (495) 939 46 37
E-mail:
Website: http://intsys.msu.ru
Keywords: discrete mathematics, theory of control systems, theory of databases, automata theory complexity of search algorithms.
UDC: 519.7, 517.977, 519.1, 519.95

Subject:

Discrete mathematics, theory of control systems, theory of databases, automata theory, complexity of search algorithms, synthesis of large-scale integrated circuits (LSIC). E.E. Gasanov developed the general theory of information storage and retrieval on the basis of a new information?graph model of data. He solved the problem of optimal synthesis of information graphs for a wide class of search problems including those most often used in databases. The constructed theory covers all particular findings for concrete databases and provides algorithms and new technologies for synthesizing databases of new type, which are more efficient than the known algorithms. Gasanov laid the foundations of the theory of predictive automata and in the framework of this theory received criteria for predictability and partial predictability for some classes of super-events.

Biography

Gasanov Elyar Eldarovich was born on November 14, 1959, in Moscow. Mathematician. Graduated from the Department of Computational Mathematics and Cybernetics of MSU in 1982.
Philosophy Doctor in mathematics (1986), Doctor of Science in mathematics (1999).
Professor of the Chair of Mathematical theory of intelligent systems of the Department of Mechanics and Mathematics (2003). In Moscow State University, E. E. Gasanov lectures the special courses "Theory of intelligent systems", "Theory of databases and information retrieval", "Additional chapters of discrete mathematics and mathematical cybernetics" and holds a special seminar in problems of complexity of search algorithms.
Deputy Chief Editor of the journal "Intelligent systems. Theory and applications".
Area of scientific interests. Discrete mathematics, theory of control systems, theory of databases, automata theory, complexity of search algorithms, synthesis of large-scale integrated circuits (LSIC). E. E. Gasanov developed the general theory of information storage and retrieval on the basis of a new information-graph model of data. He solved the problem of optimal synthesis of information graphs for a wide class of search problems including those most often used in databases. The constructed theory covers all particular findings for concrete databases and provides algorithms and new technologies for synthesizing databases of new type, which are more efficient than the known algorithms. Gasanov laid the foundations of the theory of predictive automata and in the framework of this theory received criteria for predictability and partial predictability for some classes of super-events.
The Candidate Dissertation of E. E. Gasanov was entitled "On the complexity of information retrieval"; his Doctoral dissertation "Optimal solution of storage and search basic problems in information?graph model of data".
Eighteen disciples of E.E. Gasanov obtained their PhD degrees. E. E. Gasanov published more than 175 scientific works including 15 books and more than 65 patents of the USA.

   
Main publications:
  1. Gasanov E. E., Kudryavtsev V. B., Teoriya khraneniya i poiska informatsii, Fizmatlit, Moskva, 2002  zmath
  2. Gasanov E. E., Teoriya slozhnosti informatsionnogo poiska, Izdatelstvo Tsentra prikladnykh issledovanii pri mekhaniko-matematicheskom fakultete MGU, Moskva, 2005
  3. Kudryavtsev V. B., Gasanov E. E., Podkolzin A. S., Vvedenie v teoriyu intellektualnykh sistem, Izdatelskii otdel fakulteta vychislitelnoi matematiki i kibernetiki MGU im. M. V. Lomonosova, Moskva, 2006
  4. Kudryavtsev V. B., Gasanov E. E., Dolotova O. A., Pogosyan G. R., Teoriya testirovaniya logicheskikh ustroistv, Fizmatlit, Moskva, 2006

http://www.mathnet.ru/eng/person26853
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/250789

Publications in Math-Net.Ru
2019
1. D. I. Vasilyev, È. È. Gasanov, V. B. Kudryavtsev, “Оn stabilization of an automaton model of migration processes”, Diskr. Mat., 31:1 (2019),  56–71  mathnet  elib
2018
2. E. M. Perper, È. È. Gasanov, V. B. Kudryavtsev, “On the semantic analysis of juridical documents”, Intelligent systems. Theory and applications, 22:3 (2018),  45–88  mathnet
2017
3. È. È. Gasanov, “On the functional complexity of the two-dimensional domination problem”, Intelligent systems. Theory and applications, 21:4 (2017),  102–114  mathnet
2016
4. È. È. Gasanov, A. M. Zubkov, N. V. Klykova, “The algorithm for identical object searching with bounded worst-case complexity and linear memory”, Diskr. Mat., 28:2 (2016),  3–11  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 26:5 (2016), 273–278  isi  elib  scopus
5. È. È. Gasanov, A. A. Pletnev, “Моделирование динамических баз данных”, Intelligent systems. Theory and applications, 20:3 (2016),  146–150  mathnet
6. È. È. Gasanov, P. A. Panteleev, A. Sokolov, Yu. S. Shutkin, “Hardware implementation of on-the-fly reconfigurable BCH decoder”, Intelligent systems. Theory and applications, 20:2 (2016),  53–66  mathnet
2009
7. E. E. Gasanov, “Information storage and search complexity theory”, Fundam. Prikl. Mat., 15:3 (2009),  49–73  mathnet  mathscinet; J. Math. Sci., 168:1 (2010), 32–48  scopus
2006
8. A. G. Verenkin, È. È. Gasanov, “On the automaton determinization of sets of superworks”, Diskr. Mat., 18:2 (2006),  84–97  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 16:3 (2006), 229–243  scopus
2004
9. È. È. Gasanov, A. N. Erokhin, “A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem”, Diskr. Mat., 16:4 (2004),  49–64  mathnet  mathscinet  zmath; Discrete Math. Appl., 14:6 (2004), 631–646
2002
10. È. È. Gasanov, I. V. Kuznetsova, “On the functional complexity of a two-dimensional interval search problem”, Diskr. Mat., 14:1 (2002),  114–141  mathnet  mathscinet  zmath; Discrete Math. Appl., 12:1 (2002), 69–95
2000
11. È. È. Gasanov, “Estimates for the complexity of a method for solving the problem of inclusive search”, Diskr. Mat., 12:2 (2000),  118–139  mathnet  mathscinet  zmath; Discrete Math. Appl., 10:3 (2000), 295–318
1999
12. È. È. Gasanov, Yu. P. Lugovskaya, “A constant, in the worst case, algorithm for the search for identical objects”, Diskr. Mat., 11:4 (1999),  139–144  mathnet  mathscinet  zmath; Discrete Math. Appl., 9:6 (1999), 679–684
13. È. È. Gasanov, E. R. Erokhina, “Modeling and search complexity in multiprocessor systems”, Diskr. Mat., 11:3 (1999),  63–82  mathnet  mathscinet  zmath; Discrete Math. Appl., 9:5 (1999), 523–544
1998
14. È. È. Gasanov, “A lower bound for the complexity of inclusive search in the class of tree-like circuits”, Diskr. Mat., 10:1 (1998),  63–72  mathnet  mathscinet  zmath; Discrete Math. Appl., 8:1 (1998), 99–108
1997
15. È. È. Gasanov, T. V. Mkhitarova, “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  mathnet  mathscinet  zmath
1996
16. È. È. Gasanov, “A lower bound for the complexity of information networks for a partial ordering relation”, Diskr. Mat., 8:4 (1996),  108–122  mathnet  mathscinet  zmath; Discrete Math. Appl., 6:6 (1996), 585–598
17. È. È. Gasanov, “Instantaneously solvable search problems”, Diskr. Mat., 8:3 (1996),  119–134  mathnet  mathscinet  zmath; Discrete Math. Appl., 6:5 (1996), 467–482
1995
18. È. È. Gasanov, “On a one-dimensional problem of interval search”, Diskr. Mat., 7:2 (1995),  40–60  mathnet  mathscinet  zmath; Discrete Math. Appl., 5:2 (1995), 117–135
19. È. È. Gasanov, “Some instantly solvable in average search problems”, Fundam. Prikl. Mat., 1:1 (1995),  123–146  mathnet  mathscinet  zmath
1992
20. È. È. Gasanov, “A lower bound on the complexity of information networks for a class of information search problems”, Diskr. Mat., 4:3 (1992),  118–127  mathnet  mathscinet  zmath
1991
21. È. È. Gasanov, “On a mathematical information search mode”, Diskr. Mat., 3:2 (1991),  69–76  mathnet  mathscinet  zmath

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020