| 2020 | CSR | Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations. | Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev |
| 2018 | SOFSEM | 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 |
| 2011 | PACT | Classical and Quantum Parallelism in the Quantum Fingerprinting Method. | Farid M. Ablayev, Alexander Vasiliev |
| 2007 | LATA | Classical Simulation Complexity of Quantum Branching Programs. | Farid M. Ablayev, Aida Gainutdinova |
| 2005 | DLT | Complexity of Quantum Uniform and Nonuniform Automata. | Farid M. Ablayev, Aida Gainutdinova |
| 2003 | FCT | Classical Simulation Complexity of Quantum Machines. | Farid M. Ablayev, Aida Gainutdinova |
| 2002 | ICALP | Quantum and Stochastic Branching Programs of Bounded Width. | Farid M. Ablayev, Cristopher Moore, Chris Pollett |
| 2001 | FCT | A Discrete Approximation and Communication Complexity Approach to the Superposition Problem. | Farid M. Ablayev, Svetlana Ablayeva |
| 2001 | FCT | On Computational Power of Quantum Branching Programs. | Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski |
| 2000 | ICALP | On Complexity of Regular (1, +k)-Branching Programs. | Farid M. Ablayev |
| 2000 | MFCS | On the Lower Bounds for One-Way Quantum Automata. | Farid M. Ablayev, Aida Gainutdinova |
| 1997 | ICALP | Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs. | Farid M. Ablayev |
| 1996 | ICALP | On the Power of Randomized Branching Programs. | Farid M. Ablayev, Marek Karpinski |
| 1994 | LFCS | Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach. | Farid M. Ablayev |
| 1993 | ICALP | Lower Bounds for One-way Probabilistic Communication Complexity. | Farid M. Ablayev |
| 1989 | MFCS | On Comparing Probabilistic and Deterministic Automata Complexity of Languages. | Farid M. Ablayev |
| 1988 | MFCS | Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability. | Farid M. Ablayev |
| 1987 | FCT | Possibilities of Probabilistic on-line Counting Machines. | Farid M. Ablayev |
| 1986 | MFCS | Why Sometimes Probabilistic Algorithms Can Be More Effective. | Farid M. Ablayev, Rusins Freivalds |