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
415*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
ICALP, 348-356, 1996
86*1996
Cryptographic quantum hashing
FM Ablayev, AV Vasiliev
Laser Physics Letters 11 (2), 025202, 2013
742013
On computational power of quantum branching programs
F Ablayev, A Gainutdinova, M Karpinski
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, 2001
742001
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
632005
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
482019
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
482014
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
382016
On the lower bounds for one-way quantum automata
F Ablayev, A Gainutdinova
Mathematical Foundations of Computer Science 2000: 25th International, 2000
382000
Algorithms for quantum branching programs based on fingerprinting
F Ablayev, A Vasiliev
arXiv preprint arXiv:0911.2317, 2009
372009
Randomization and nondeterminism are comparable for ordered read-once branching programs
F Ablayev
Automata, Languages and Programming: 24th International Colloquium, ICALP'97, 1997
371997
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
362002
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
292018
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
272018
On the balanced quantum hashing
F Ablayev, M Ablayev, A Vasiliev
Journal of Physics: Conference Series 681 (1), 012019, 2016
262016
Why sometimes probabilistic algorithms can be more effective
F Ablaev, R Freivalds
Mathematical Foundations of Computer Science 1986, 1-14, 1986
261986
Lower bounds for one-way probabilistic communication complexity
F Ablayev
Automata, Languages and Programming: 20th International Colloquium, ICALP 93, 2005
252005
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
251996
On the concept of cryptographic quantum hashing
F Ablayev, M Ablayev
Laser Physics Letters 12 (12), 125204, 2015
232015
The system can't perform the operation now. Try again later.
Articles 1–20