Farid Ablayev
TitleCited byYear
Lower bounds for one-way probabilistic communication complexity and their application to space complexity
F Ablayev
Theoretical Computer Science 157 (2), 139-159, 1996
941996
On the power of randomized branching programs
F Ablayev, M Karpinski
International Colloquium on Automata, Languages, and Programming, 348-356, 1996
751996
On computational power of quantum branching programs
F Ablayev, A Gainutdinova, M Karpinski
International Symposium on Fundamentals of Computation Theory, 59-70, 2001
682001
Cryptographic quantum hashing
FM Ablayev, AV Vasiliev
Laser Physics Letters 11 (2), 025202, 2013
482013
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
472005
Randomization and nondeterminism are comparable for ordered read-once branching programs
F Ablayev
International Colloquium on Automata, Languages, and Programming, 195-202, 1997
391997
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
362014
On the lower bounds for one-way quantum automata
F Ablayev, A Gainutdinova
International Symposium on Mathematical Foundations of Computer Science, 132-140, 2000
312000
Quantum and stochastic branching programs of bounded width
F Ablayev, C Moore, C Pollett
International Colloquium on Automata, Languages, and Programming, 343-354, 2002
302002
Why sometimes probabilistic algorithms can be more effective
F Ablaev, R Freivalds
Mathematical Foundations of Computer Science 1986, 1-14, 1986
281986
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
272016
Algorithms for quantum branching programs based on fingerprinting
F Ablayev, A Vasiliev
arXiv preprint arXiv:0911.2317, 2009
272009
A Lower Bound for Integer Multiplication on Randomized Read Once Branching Programs
F Ablaev, M Karpiński
Inst. für Informatik, 1998
22*1998
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
Complexity of quantum uniform and nonuniform automata
F Ablayev, A Gainutdinova
International Conference on Developments in Language Theory, 78-87, 2005
202005
Lower bounds for one-way probabilistic communication complexity
F Ablayev
International Colloquium on Automata, Languages, and Programming, 241-252, 1993
191993
Computing Boolean functions via quantum hashing
F Ablayev, A Vasiliev
Computing with New Resources, 149-160, 2014
182014
Extension of the hierarchy for k-OBDDs of small width
FM Ablayev, KR Khadiev
Russian Mathematics 57 (3), 46-50, 2013
182013
On the computation of boolean functions by quantum branching programs via fingerprinting
F Ablayev, A Vasiliev
Electronic Colloquium on Computational Complexity (ECCC) 15 (059), 2008
152008
On complexity of quantum branching programs computing equality-like boolean functions
F Ablayev, A Khasianov, A Vasiliev
ECCC (to appear in 2010), 2008
142008
The system can't perform the operation now. Try again later.
Articles 1–20