Farid M. Ablayev

53 papers A* 4B 10C 2Misc 3Journal 23Unranked 10
YearRankTypeTitle / Venue / Authors
2024 J jnl
Quantum search in a dictionary based on fingerprinting-hashing.
CoRR
Farid M. Ablayev, Nailya Salikhova, Marat Ablayev
2020 — conf
Integrated-Optics Quantum Processor Based on Entangled Photons in Coupled Cavities.
EWDTS
Farid M. Ablayev, Sergey N. Andrianov, Sergey A. Moiseev, Alexander Vasiliev
2020 J jnl
On quantum methods for machine learning problems part I: Quantum tools.
Big Data Min. Anal.
Farid M. Ablayev, Marat Ablayev, Joshua Zhexue Huang, Kamil Khadiev, Nailya Salikhova, Dingming Wu
2020 J jnl
On quantum methods for machine learning problems part II: Quantum classification algorithms.
Big Data Min. Anal.
Farid M. Ablayev, Marat Ablayev, Joshua Zhexue Huang, Kamil Khadiev, Nailya Salikhova, Dingming Wu
2020 Misc conf
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations.
CSR
Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev
2018 — conf
Classical and Quantum Computations with Restricted Memory.
Adventures Between Lower Bounds and Higher Altitudes
Farid M. Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev
2018 B conf
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test.
SOFSEM
Farid M. Ablayev, Andris Ambainis, Kamil Khadiev, Aliya Khadieva
2018 J jnl
Quantum-Assisted Blockchain.
CoRR
D. Sapaev, D. Bulychkov, Farid M. Ablayev, Alexander Vasiliev, Mansur Ziatdinov
2017 J jnl
Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs.
CoRR
Farid M. Ablayev, Kamil Khadiev, Aliya Khadieva
2016 J jnl
Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects.
Balt. J. Mod. Comput.
Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev, Mansur Ziatdinov
2014 — conf
Computing Boolean Functions via Quantum Hashing.
Computing with New Resources
Farid M. Ablayev, Alexander Vasiliev
2014 J jnl
Quantum Hashing via Classical ε-universal Hashing Constructions.
CoRR
Farid M. Ablayev, Marat Ablayev
2014 — conf
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas.
DCFS
Farid M. Ablayev, Marat Ablayev
2014 — conf
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs.
DCFS
Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz
2014 J jnl
Very narrow quantum OBDDs and width hierarchies for classical OBDDs.
CoRR
Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz
2013 J jnl
Algorithms for Quantum Branching Programs Based on Fingerprinting.
Int. J. Softw. Informatics
Farid M. Ablayev, Alexander Vasiliev
2011 B conf
Classical and Quantum Parallelism in the Quantum Fingerprinting Method.
PaCT
Farid M. Ablayev, Alexander Vasiliev
2010 J jnl
A Communication Approach to the Superposition Problem.
Fundam. Informaticae
Farid M. Ablayev, Svetlana Ablayeva
2010 Misc ed.
Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings
CSR
Farid M. Ablayev, Ernst W. Mayr
2010 — conf
On Computational Power of Quantum Read-Once Branching Programs
HPC
Farid M. Ablayev, Alexander Vasiliev
2010 — ed.
Proceedings CSR 2010 Workshop on High Productivity Computations, HPC 2010, Kazan, Russia, June 21-22, 2010.
HPC
Farid M. Ablayev, Bob Coecke, Alexander Vasiliev
2009 — conf
Algorithms for Quantum Branching Programs Based on Fingerprinting
DCM
Farid M. Ablayev, Alexander Vasiliev
2008 J jnl
On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions.
Electron. Colloquium Comput. Complex.
Farid M. Ablayev, Airat Khasianov, Alexander Vasiliev
2008 J jnl
On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting.
Electron. Colloquium Comput. Complex.
Farid M. Ablayev, Alexander Vasiliev
2007 — conf
Classical Simulation Complexity of Quantum Branching Programs.
Algebraic Methods in Computational Complexity
Farid M. Ablayev
2007 C conf
Classical Simulation Complexity of Quantum Branching Programs.
LATA
Farid M. Ablayev, Aida Gainutdinova
2005 C conf
Complexity of Quantum Uniform and Nonuniform Automata.
Developments in Language Theory
Farid M. Ablayev, Aida Gainutdinova
2005 J jnl
On the computational power of probabilistic and quantum branching program.
Inf. Comput.
Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett
2005 — conf
The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach.
SAGA
Farid M. Ablayev
2003 J jnl
A lower bound for integer multiplication on randomized ordered read-once branching programs.
Inf. Comput.
Farid M. Ablayev, Marek Karpinski
2003 B conf
Classical Simulation Complexity of Quantum Machines.
FCT
Farid M. Ablayev, Aida Gainutdinova
2002 A* conf
Quantum and Stochastic Branching Programs of Bounded Width.
ICALP
Farid M. Ablayev, Cristopher Moore, Chris Pollett
2002 J jnl
Quantum and Stochastic Programs of Bounded Width
Electron. Colloquium Comput. Complex.
Chris Pollett, Farid M. Ablayev, Cristopher Moore
2001 B conf
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem.
FCT
Farid M. Ablayev, Svetlana Ablayeva
2001 J jnl
On BPP versus NPcoNP for ordered read-once branching programs.
Theor. Comput. Sci.
Farid M. Ablayev, Marek Karpinski, Rustam Mubarakzjanov
2001 B conf
On Computational Power of Quantum Branching Programs.
FCT
Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski
2000 — conf
On Complexity of Regular (1, +k)-Branching Programs.
ICALP Satellite Workshops
Farid M. Ablayev
2000 B conf
On the Lower Bounds for One-Way Quantum Automata.
MFCS
Farid M. Ablayev, Aida Gainutdinova
1999 J jnl
On Complexity of Regular (1,+k)-Branching Programs
Electron. Colloquium Comput. Complex.
Farid M. Ablayev
1998 J jnl
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem
Electron. Colloquium Comput. Complex.
Farid M. Ablayev, Svetlana Ablayeva
1998 J jnl
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs
Electron. Colloquium Comput. Complex.
Farid M. Ablayev, Marek Karpinski
1998 J jnl
On the Power of Randomized Ordered Branching Programs
Electron. Colloquium Comput. Complex.
Farid M. Ablayev, Marek Karpinski
1997 A* conf
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs.
ICALP
Farid M. Ablayev
1997 J jnl
Randomization and nondeterminsm are incomparable for ordered read-once branching programs
Electron. Colloquium Comput. Complex.
Farid M. Ablayev
1996 J jnl
Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity.
Theor. Comput. Sci.
Farid M. Ablayev
1996 A* conf
On the Power of Randomized Branching Programs.
ICALP
Farid M. Ablayev, Marek Karpinski
1995 J jnl
On the Power of Randomized Branching Programs
Electron. Colloquium Comput. Complex.
Farid M. Ablayev, Marek Karpinski
1994 Misc conf
Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach.
LFCS
Farid M. Ablayev
1993 A* conf
Lower Bounds for One-way Probabilistic Communication Complexity.
ICALP
Farid M. Ablayev
1989 B conf
On Comparing Probabilistic and Deterministic Automata Complexity of Languages.
MFCS
Farid M. Ablayev
1988 B conf
Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability.
MFCS
Farid M. Ablayev
1987 B conf
Possibilities of Probabilistic on-line Counting Machines.
FCT
Farid M. Ablayev
1986 B conf
Why Sometimes Probabilistic Algorithms Can Be More Effective.
MFCS
Farid M. Ablayev, Rusins Freivalds