| On computational power of quantum branching programs F Ablayev, A Gainutdinova, M Karpinski Fundamentals of Computation Theory: 13th International Symposium, FCT 2001 …, 2001 | 82 | 2001 |
| On the computational power of probabilistic and quantum branching program F Ablayev, A Gainutdinova, M Karpinski, C Moore, C Pollett Information and Computation 203 (2), 145-162, 2005 | 73 | 2005 |
| Very narrow quantum OBDDs and width hierarchies for classical OBDDs F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz Descriptional Complexity of Formal Systems: 16th International Workshop …, 2014 | 49 | 2014 |
| Very narrow quantum OBDDs and width hierarchies for classical OBDDs F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz Lobachevskii Journal of Mathematics 37, 670-682, 2016 | 47 | 2016 |
| On the lower bounds for one-way quantum automata F Ablayev, A Gainutdinova International Symposium on Mathematical Foundations of Computer Science, 132-140, 2000 | 43 | 2000 |
| Complexity of quantum uniform and nonuniform automata F Ablayev, A Gainutdinova Developments in Language Theory: 9th International Conference, DLT 2005 …, 2005 | 30 | 2005 |
| Comparative complexity of quantum and classical OBDDs for total and partial functions AF Gainutdinova Russian Mathematics 59, 26-35, 2015 | 22 | 2015 |
| Nondeterministic unitary OBDDs A Gainutdinova, A Yakaryılmaz Computer Science–Theory and Applications: 12th International Computer …, 2017 | 20 | 2017 |
| Unary probabilistic and quantum automata on promise problems A Gainutdinova, A Yakaryılmaz International Conference on Developments in Language Theory, 252-263, 2015 | 19 | 2015 |
| Unary probabilistic and quantum automata on promise problems A Gainutdinova, A Yakaryılmaz Quantum Information Processing 17, 1-17, 2018 | 17 | 2018 |
| Classical simulation complexity of quantum machines F Ablayev, A Gainutdinova International Symposium on Fundamentals of Computation Theory, 296-302, 2003 | 6 | 2003 |
| Квантовые вычисления АФ Гайнутдинова метод. пособие. АФ Гайнутдинова.–Казань: Казанский государственный …, 2009 | 5 | 2009 |
| О сравнительной сложности квантовых и классических бинарных программ АФ Гайнутдинова Дискретная математика 14 (3), 109-121, 2002 | 5 | 2002 |
| О моделировании квантовых и классических бинарных программ АФ Гайнутдинова Дискретный анализ и исследование операций 13 (1), 45-64, 2006 | 3 | 2006 |
| On relative complexity of quantum and classical branching programs AF Gainutdinova Discrete Mathematics and Applications 12 (5), 515-526, 2002 | 3 | 2002 |
| On the full monomial automorphism groups of Reed–Solomon codes and their MDS-extensions V Kugurakov, A Gainutdinova Lobachevskii Journal of Mathematics 37, 650-669, 2016 | 2 | 2016 |
| Functioning of the reflexive pronouns in the contemporary Russian language T Troshkina, A Gainutdinova Asian Social Science 11 (1), 22, 2015 | 2 | 2015 |
| Сравнительная сложность квантовых и классических OBDD для всюду определенных и частичных функций АФ Гайнутдинова Известия высших учебных заведений. Математика, 32-43, 2015 | 2 | 2015 |
| On classical stimulation of quantum machines F Ablayev, A Gainutdinova Quantum Informatics 2004 5833, 109-115, 2005 | 2 | 2005 |
| On calculation of monomial automorphisms of linear cyclic codes VS Kugurakov, A Gainutdinova, T Anisimova Lobachevskii Journal of Mathematics 39, 1024-1038, 2018 | 1 | 2018 |
Farid AblayevKazan Federal UniversityVerified email at kpfu.ru
