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.

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.

1. Gasanov E. E., Kudryavtsev V. B., Teoriya khraneniya i poiska informatsii, Fizmatlit, Moskva, 2002  
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

• Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
• Moscow Mathematical Society