|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
M. F. Ablayev, F. M. Ablayev, A. V. Vasiliev, “Analysis of the amplitude form of the quantum hash function”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 165:1 (2023), 5–15  |
|
2022 |
| 2. |
S. N. Andrianov, N. S. Andrianova, F. M. Ablayev, Yu. Yu. Kochneva, “Context query on photons with the use of Bell tests”, Inform. Primen., 16:1 (2022), 20–24  |
|
2020 |
| 3. |
F. M. Ablayev, M. T. Ziatdinov, “Universal hash functions from quantum procedures”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 162:3 (2020), 259–268 |
3
|
|
2016 |
| 4. |
F. M. Ablayev, M. F. Ablayev, “On the concept of quantum hashing”, Mat. Vopr. Kriptogr., 7:2 (2016), 7–20  |
|
2014 |
| 5. |
F. M. Ablayev, M. F. Ablayev, A. V. Vasilev, “Universal quantum hashing”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014), 7–18 |
3
|
|
2013 |
| 6. |
F. M. Ablayev, K. R. Khadiev, “Clarification of the hierarchy of classes of boolean functions representable as a k-OBDD branching program models”, Izv. Vyssh. Uchebn. Zaved. Mat., 2013, no. 3, 56–61 ; Russian Math. (Iz. VUZ), 57:3 (2013), 46–50  |
13
|
|
2009 |
| 7. |
F. M. Ablayev, A. V. Vasilyev, “On quantum realisation of Boolean functions by the fingerprinting technique”, Diskr. Mat., 21:4 (2009), 3–19 ; Discrete Math. Appl., 19:6 (2009), 555–572 |
9
|
| 8. |
F. M. Ablayev, “On Complexity of Classical Simulation of Quantum Branching Programs”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009), 7–15 |
|
2008 |
| 9. |
F. M. Ablayev, S. G. Ablaeva, “Superposition Problem of Continuous Functions. A Communication Approach”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 150:1 (2008), 5–18  |
|
1991 |
| 10. |
F. M. Ablayev, “Comparative complexity of probabilistic and deterministic automata”, Diskr. Mat., 3:2 (1991), 114–120 |
|
1988 |
| 11. |
F. M. Ablayev, “On the complexity of probabilistic automata with an isolated cross-section point”, Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 7, 88–89 ; Soviet Math. (Iz. VUZ), 32:7 (1988), 143–145 |
| 12. |
F. M. Ablayev, “Influence of the degree of isolation of the cutpoint on the number of states of a probabilistic automaton”, Mat. Zametki, 44:3 (1988), 289–297 ; Math. Notes, 44:3 (1988), 639–643  |
|
1985 |
| 13. |
F. M. Ablayev, “Possibilities of probabilistic machines with respect to representation of languages in real time”, Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 7, 32–40 ; Soviet Math. (Iz. VUZ), 29:7 (1985), 44–55 |
|
1982 |
| 14. |
F. M. Ablayev, “Metrization criterion for regularity of languages representable in countable automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 9, 67–69 |
|
1980 |
| 15. |
F. M. Ablayev, “The problem of reduction of automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1980, no. 3, 75–77 ; Soviet Math. (Iz. VUZ), 24:3 (1980), 76–79 |
|
|
|
2014 |
| 16. |
Yu. I. Zhuravlev, F. M. Ablayev, V. B. Alekseev, O. M. Kasim-zade, “The XVII International Conference “Problems of Theoretical Cybernetics””, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014), 5–6 |
|
2009 |
| 17. |
Yu. I. Zhuravlev, F. M. Ablayev, V. B. Alekseev, O. M. Kasim-zade, “The XV International Conference “Problems of Theoretical Cybernetics””, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009), 5–6 |
|
| Organisations |
|
| |
|
|
Contact us: