Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006 | 255* | 2006 |
Lower bounds for one-way probabilistic communication complexity and their application to space complexity F Ablayev Theoretical Computer Science 157 (2), 139-159, 1996 | 111 | 1996 |
On the power of randomized branching programs F Ablayev, M Karpinski Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996 | 96* | 1996 |
Cryptographic quantum hashing FM Ablayev, AV Vasiliev Laser Physics Letters 11 (2), 025202, 2013 | 82 | 2013 |
On computational power of quantum branching programs F Ablayev, A Gainutdinova, M Karpinski Fundamentals of Computation Theory: 13th International Symposium, FCT 2001 …, 2001 | 80 | 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 | 66 | 2005 |
On quantum methods for machine learning problems part I: Quantum tools F Ablayev, M Ablayev, JZ Huang, K Khadiev, N Salikhova, D Wu Big data mining and analytics 3 (1), 41-55, 2019 | 64 | 2019 |
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 | 46 | 2014 |
Algorithms for quantum branching programs based on fingerprinting F Ablayev, A Vasiliev arXiv preprint arXiv:0911.2317, 2009 | 43 | 2009 |
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 | 42 | 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 | 42 | 2000 |
Quantum and stochastic branching programs of bounded width: Track a F Ablayev, C Moore, C Pollett Automata, Languages and Programming: 29th International Colloquium, ICALP …, 2002 | 38 | 2002 |
Randomization and nondeterminism are comparable for ordered read-once branching programs F Ablayev Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997 | 38 | 1997 |
Quantum-assisted blockchain FM Ablayev, DA Bulychkov, DA Sapaev, AV Vasiliev, MT Ziatdinov Lobachevskii Journal of Mathematics 39, 957-960, 2018 | 33 | 2018 |
On quantum methods for machine learning problems part II: Quantum classification algorithms F Ablayev, M Ablayev, JZ Huang, K Khadiev, N Salikhova, D Wu Big Data Mining and Analytics 3 (1), 56-67, 2019 | 32 | 2019 |
Classical and quantum computations with restricted memory F Ablayev, M Ablayev, K Khadiev, A Vasiliev Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to …, 2018 | 31 | 2018 |
On the balanced quantum hashing F Ablayev, M Ablayev, A Vasiliev Journal of Physics: Conference Series 681 (1), 012019, 2016 | 31 | 2016 |
Lower bounds for one-way probabilistic communication complexity F Ablayev International Colloquium on Automata, Languages, and Programming, 241-252, 1993 | 28 | 1993 |
Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test F Ablayev, A Ambainis, K Khadiev, A Khadieva SOFSEM 2018: Theory and Practice of Computer Science: 44th International …, 2018 | 27 | 2018 |
On the concept of cryptographic quantum hashing F Ablayev, M Ablayev Laser Physics Letters 12 (12), 125204, 2015 | 26 | 2015 |