RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Ablayev Farid Mansurovich

Statistics Math-Net.Ru
Total publications: 14
Scientific articles: 12
Cited articles: 1
Citations in Math-Net.Ru: 1

Number of views:
This page:1091
Abstract pages:2249
Full texts:617
References:83
Professor
Doctor of physico-mathematical sciences (1995)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
E-mail: ,
Website: http://www.ksu.ru/persons/9309.ru.html

http://www.mathnet.ru/eng/person29974
List of publications on Google Scholar
List of publications on ZentralBlatt
http://www.ams.org/mathscinet/search/author.html?return=viewitems&mrauthid=224097

Publications in Math-Net.Ru
1. On the concept of quantum hashing
F. M. Ablayev, M. F. Ablayev
Mat. Vopr. Kriptogr., 7:2 (2016),  7–20
2. Universal quantum hashing
F. M. Ablayev, M. F. Ablayev, A. V. Vasilev
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  7–18
3. Clarification of the hierarchy of classes of boolean functions representable as a k-OBDD branching program models
F. M. Ablayev, K. R. Khadiev
Izv. Vyssh. Uchebn. Zaved. Mat., 2013, no. 3,  56–61
4. On quantum realisation of Boolean functions by the fingerprinting technique
F. M. Ablayev, A. V. Vasilyev
Diskr. Mat., 21:4 (2009),  3–19
5. On Complexity of Classical Simulation of Quantum Branching Programs
F. M. Ablayev
Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  7–15
6. Superposition Problem of Continuous Functions. A Communication Approach
F. M. Ablayev, S. G. Ablaeva
Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 150:1 (2008),  5–18
7. Comparative complexity of probabilistic and deterministic automata
F. M. Ablayev
Diskr. Mat., 3:2 (1991),  114–120
8. On the complexity of probabilistic automata with an isolated cross-section point
F. M. Ablayev
Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 7,  88–89
9. Influence of the degree of isolation of the cutpoint on the number of states of a probabilistic automaton
F. M. Ablayev
Mat. Zametki, 44:3 (1988),  289–297
10. Possibilities of probabilistic machines with respect to representation of languages in real time
F. M. Ablayev
Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 7,  32–40
11. Metrization criterion for regularity of languages representable in countable automata
F. M. Ablayev
Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 9,  67–69
12. The problem of reduction of automata
F. M. Ablayev
Izv. Vyssh. Uchebn. Zaved. Mat., 1980, no. 3,  75–77

13. The XVII International Conference “Problems of Theoretical Cybernetics”
Yu. I. Zhuravlev, F. M. Ablayev, V. B. Alekseev, O. M. Kasim-zade
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  5–6
14. The XV International Conference “Problems of Theoretical Cybernetics”
Yu. I. Zhuravlev, F. M. Ablayev, V. B. Alekseev, O. M. Kasim-zade
Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  5–6

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