Farid M. Ablayev

Publication Activity (10 Years)

Years Active: 1986-2020
Publications (10 Years): 9

Top Topics

Ordered Binary Decision Diagrams

Quantum Computation

Communication Protocols

Top Venues

Big Data Min. Anal.

Computing with New Resources

Publications

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