RUS  ENG
Full version
PEOPLE

Ablayev Farid Mansurovich

Publications in Math-Net.Ru

  1. Analysis of the amplitude form of the quantum hash function

    Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 165:1 (2023),  5–15
  2. Context query on photons with the use of Bell tests

    Inform. Primen., 16:1 (2022),  20–24
  3. Universal hash functions from quantum procedures

    Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 162:3 (2020),  259–268
  4. On the concept of quantum hashing

    Mat. Vopr. Kriptogr., 7:2 (2016),  7–20
  5. Universal quantum hashing

    Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  7–18
  6. 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
  7. On quantum realisation of Boolean functions by the fingerprinting technique

    Diskr. Mat., 21:4 (2009),  3–19
  8. On Complexity of Classical Simulation of Quantum Branching Programs

    Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  7–15
  9. Superposition Problem of Continuous Functions. A Communication Approach

    Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 150:1 (2008),  5–18
  10. Comparative complexity of probabilistic and deterministic automata

    Diskr. Mat., 3:2 (1991),  114–120
  11. On the complexity of probabilistic automata with an isolated cross-section point

    Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 7,  88–89
  12. 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
  13. Possibilities of probabilistic machines with respect to representation of languages in real time

    Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 7,  32–40
  14. Metrization criterion for regularity of languages representable in countable automata

    Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 9,  67–69
  15. The problem of reduction of automata

    Izv. Vyssh. Uchebn. Zaved. Mat., 1980, no. 3,  75–77

  16. The XVII International Conference “Problems of Theoretical Cybernetics”

    Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  5–6
  17. The XV International Conference “Problems of Theoretical Cybernetics”

    Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  5–6


© Steklov Math. Inst. of RAS, 2026