Farid Ablayev
Título
Citado por
Citado por
Año
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
D Ünay, Z Çataltepe, S Aksoy
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2010
170*2010
Lower bounds for one-way probabilistic communication complexity and their application to space complexity
F Ablayev
Theoretical Computer Science 157 (2), 139-159, 1996
1021996
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
712001
Cryptographic quantum hashing
FM Ablayev, AV Vasiliev
Laser Physics Letters 11 (2), 025202, 2013
612013
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
522005
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
432014
On the lower bounds for one-way quantum automata
F Ablayev, A Gainutdinova
International Symposium on Mathematical Foundations of Computer Science, 132-140, 2000
352000
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
Randomization and nondeterminism are comparable for ordered read-once branching programs
F Ablayev
International Colloquium on Automata, Languages, and Programming, 195-202, 1997
341997
Algorithms for quantum branching programs based on fingerprinting
F Ablayev, A Vasiliev
arXiv preprint arXiv:0911.2317, 2009
312009
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
302016
Why sometimes probabilistic algorithms can be more effective
F Ablaev, R Freivalds
Mathematical Foundations of Computer Science 1986, 1-14, 1986
261986
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
222018
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
222018
A Lower Bound for Integer Multiplication on Randomized Read Once Branching Programs
F Ablaev, M Karpiński
Inst. für Informatik, 1998
21*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
211996
Lower bounds for one-way probabilistic communication complexity
F Ablayev
International Colloquium on Automata, Languages, and Programming, 241-252, 1993
211993
Computing Boolean functions via quantum hashing
F Ablayev, A Vasiliev
Computing with New Resources, 149-160, 2014
192014
Complexity of quantum uniform and nonuniform automata
F Ablayev, A Gainutdinova
International Conference on Developments in Language Theory, 78-87, 2005
192005
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20