Why Sometimes Probabilistic Algorithms Can Be More Effective. - Farid M. Ablayev; Rusins Freivalds (MFCS, 1986)

Possibilities of Probabilistic on-line Counting Machines. - Farid M. Ablayev (FCT, 1987)

Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability. - Farid M. Ablayev (MFCS, 1988)

On Comparing Probabilistic and Deterministic Automata Complexity of Languages. - Farid M. Ablayev (MFCS, 1989)

Lower Bounds for One-way Probabilistic Communication Complexity. - Farid M. Ablayev (ICALP, 1993)

Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach. - Farid M. Ablayev (LFCS, 1994)

On the Power of Randomized Branching Programs - Farid M. Ablayev; Marek Karpinski (Electron. Colloquium Comput. Complex., 1995)

Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity. - Farid M. Ablayev (Theor. Comput. Sci., 1996)

Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs. - Farid M. Ablayev (ICALP, 1997)

Randomization and nondeterminsm are incomparable for ordered read-once branching programs - Farid M. Ablayev (Electron. Colloquium Comput. Complex., 1997)

On the Power of Randomized Ordered Branching Programs - Farid M. Ablayev; Marek Karpinski (Electron. Colloquium Comput. Complex., 1998)

A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs - Farid M. Ablayev; Marek Karpinski (Electron. Colloquium Comput. Complex., 1998)

A Discrete Approximation and Communication Complexity Approach to the Superposition Problem - Farid M. Ablayev; Svetlana Ablayeva (Electron. Colloquium Comput. Complex., 1998)

On Complexity of Regular (1,+k)-Branching Programs - Farid M. Ablayev (Electron. Colloquium Comput. Complex., 1999)

On the Lower Bounds for One-Way Quantum Automata. - Farid M. Ablayev; Aida Gainutdinova (MFCS, 2000)

On Computational Power of Quantum Branching Programs. - Farid M. Ablayev; Aida Gainutdinova; Marek Karpinski (FCT, 2001)

On BPP versus NPcoNP for ordered read-once branching programs. - Farid M. Ablayev; Marek Karpinski; Rustam Mubarakzjanov (Theor. Comput. Sci., 2001)

Quantum and Stochastic Branching Programs of Bounded Width. - Farid M. Ablayev; Cristopher Moore; Chris Pollett (ICALP, 2002)

Quantum and Stochastic Programs of Bounded Width - Chris Pollett; Farid M. Ablayev; Cristopher Moore (Electron. Colloquium Comput. Complex., 2002)

Classical Simulation Complexity of Quantum Machines. - Farid M. Ablayev; Aida Gainutdinova (FCT, 2003)

A lower bound for integer multiplication on randomized ordered read-once branching programs. - Farid M. Ablayev; Marek Karpinski (Inf. Comput., 2003)

Complexity of Quantum Uniform and Nonuniform Automata. - Farid M. Ablayev; Aida Gainutdinova (Developments in Language Theory, 2005)

The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach. - Farid M. Ablayev (SAGA, 2005)

On the computational power of probabilistic and quantum branching program. - Farid M. Ablayev; Aida Gainutdinova; Marek Karpinski; Cristopher Moore; Chris Pollett (Inf. Comput., 2005)

Classical Simulation Complexity of Quantum Branching Programs. - Farid M. Ablayev (Algebraic Methods in Computational Complexity, 2007)

Classical Simulation Complexity of Quantum Branching Programs. - Farid M. Ablayev; Aida Gainutdinova (LATA, 2007)

On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions. - Farid M. Ablayev; Airat Khasianov; Alexander Vasiliev (Electron. Colloquium Comput. Complex., 2008)

On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting. - Farid M. Ablayev; Alexander Vasiliev (Electron. Colloquium Comput. Complex., 2008)

Algorithms for Quantum Branching Programs Based on Fingerprinting - Farid M. Ablayev; Alexander Vasiliev (DCM, 2009)

On Computational Power of Quantum Read-Once Branching Programs - Farid M. Ablayev; Alexander Vasiliev (HPC, 2010)

A Communication Approach to the Superposition Problem. - Farid M. Ablayev; Svetlana Ablayeva (Fundam. Informaticae, 2010)

Classical and Quantum Parallelism in the Quantum Fingerprinting Method. - Farid M. Ablayev; Alexander Vasiliev (PaCT, 2011)

Computing Boolean Functions via Quantum Hashing. - Farid M. Ablayev; Alexander Vasiliev (Computing with New Resources, 2014)

Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas. - Farid M. Ablayev; Marat Ablayev (DCFS, 2014)

Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. - Farid M. Ablayev; Aida Gainutdinova; Kamil Khadiev; Abuzer Yakaryilmaz (DCFS, 2014)

Quantum Hashing via Classical ε-universal Hashing Constructions. - Farid M. Ablayev; Marat Ablayev (CoRR, 2014)

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects. - Farid M. Ablayev; Marat Ablayev; Alexander Vasiliev; Mansur Ziatdinov (Balt. J. Mod. Comput., 2016)

Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs. - Farid M. Ablayev; Kamil Khadiev; Aliya Khadieva (CoRR, 2017)

Classical and Quantum Computations with Restricted Memory. - Farid M. Ablayev; Marat Ablayev; Kamil Khadiev; Alexander Vasiliev (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test. - Farid M. Ablayev; Andris Ambainis; Kamil Khadiev; Aliya Khadieva (SOFSEM, 2018)

Quantum-Assisted Blockchain. - D. Sapaev; D. Bulychkov; Farid M. Ablayev; Alexander Vasiliev; Mansur Ziatdinov (CoRR, 2018)

Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations. - Farid M. Ablayev; Marat Ablayev; Alexander Vasiliev (CSR, 2020)

Integrated-Optics Quantum Processor Based on Entangled Photons in Coupled Cavities. - Farid M. Ablayev; Sergey N. Andrianov; Sergey A. Moiseev; Alexander Vasiliev (EWDTS, 2020)

On quantum methods for machine learning problems part I: Quantum tools. - Farid M. Ablayev; Marat Ablayev; Joshua Zhexue Huang; Kamil Khadiev; Nailya Salikhova; Dingming Wu 001 (Big Data Min. Anal., 2020)

On quantum methods for machine learning problems part II: Quantum classification algorithms. - Farid M. Ablayev; Marat Ablayev; Joshua Zhexue Huang; Kamil Khadiev; Nailya Salikhova; Dingming Wu 001 (Big Data Min. Anal., 2020)

Quantum search in a dictionary based on fingerprinting-hashing. - Farid M. Ablayev; Nailya Salikhova; Marat Ablayev (CoRR, 2024)