Follow
Farid Ablayev
Title
Cited by
Cited by
Year
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
167*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
1061996
On the power of randomized branching programs
F Ablayev, M Karpinski
International Colloquium on Automata, Languages, and Programming, 348-356, 1996
761996
On computational power of quantum branching programs
F Ablayev, A Gainutdinova, M Karpinski
International Symposium on Fundamentals of Computation Theory, 59-70, 2001
702001
Cryptographic quantum hashing
FM Ablayev, AV Vasiliev
Laser Physics Letters 11 (2), 025202, 2013
682013
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
572005
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz
International Workshop on Descriptional Complexity of Formal Systems, 53-64, 2014
442014
On the lower bounds for one-way quantum automata
F Ablayev, A Gainutdinova
International Symposium on Mathematical Foundations of Computer Science, 132-140, 2000
372000
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
352019
Randomization and nondeterminism are comparable for ordered read-once branching programs
F Ablayev
International Colloquium on Automata, Languages, and Programming, 195-202, 1997
351997
Quantum and stochastic branching programs of bounded width
F Ablayev, C Moore, C Pollett
International Colloquium on Automata, Languages, and Programming, 343-354, 2002
342002
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz
Lobachevskii Journal of Mathematics 37 (6), 670-682, 2016
332016
Algorithms for quantum branching programs based on fingerprinting
F Ablayev, A Vasiliev
arXiv preprint arXiv:0911.2317, 2009
332009
Why sometimes probabilistic algorithms can be more effective
F Ablaev, R Freivalds
Mathematical Foundations of Computer Science 1986, 1-14, 1986
261986
Classical and quantum computations with restricted memory
F Ablayev, M Ablayev, K Khadiev, A Vasiliev
Adventures Between Lower Bounds and Higher Altitudes, 129-155, 2018
242018
Lower bounds for one-way probabilistic communication complexity
F Ablayev
International Colloquium on Automata, Languages, and Programming, 241-252, 1993
241993
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
International Conference on Current Trends in Theory and Practice of …, 2018
232018
On the balanced quantum hashing
F Ablayev, M Ablayev, A Vasiliev
Journal of Physics: Conference Series 681 (1), 012019, 2016
222016
Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams
F Ablayev
Proc. of the 24th Int. Coll. on Automata, Languages, and Programming (ICALP …, 1996
221996
On the concept of cryptographic quantum hashing
F Ablayev, M Ablayev
Laser Physics Letters 12 (12), 125204, 2015
212015
The system can't perform the operation now. Try again later.
Articles 1–20