Farid M. Ablayev

发表

Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings

Ernst W. Mayr, Farid M. Ablayev, 2010, CSR.

On Comparing Probabilistic and Deterministic Automata Complexity of Languages

Farid M. Ablayev, 1989, MFCS.

Algorithms for Quantum Branching Programs Based on Fingerprinting

Alexander Vasiliev, Farid M. Ablayev, 2013, Int. J. Softw. Informatics.

On the Lower Bounds for One-Way Quantum Automata

Farid M. Ablayev, Aida Gainutdinova, 2000, MFCS.

Classical Simulation Complexity of Quantum Branching Programs

Farid M. Ablayev, Aida Gainutdinova, 2007, LATA.

Complexity of Quantum Uniform and Nonuniform Automata

Farid M. Ablayev, Aida Gainutdinova, 2005, Developments in Language Theory.

Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs

Farid M. Ablayev, 1997, ICALP.

On Computational Power of Quantum Branching Programs

Marek Karpinski, Farid M. Ablayev, Aida Gainutdinova, 2001, FCT.

On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting

Alexander Vasiliev, Farid M. Ablayev, 2008, Electron. Colloquium Comput. Complex..

Classical and Quantum Parallelism in the Quantum Fingerprinting Method

Alexander Vasiliev, Farid M. Ablayev, F. Ablayev, 2011, PaCT.

Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach

Farid M. Ablayev, 1994, LFCS.

Comparative power of quantum and classical computation models

Farid M. Ablayev, 2005, Other Conferences.

Why Sometimes Probabilistic Algorithms Can Be More Effective

Rusins Freivalds, Farid M. Ablayev, R. Freivalds, 1996, MFCS.

On the Power of Randomized Branching Programs

Marek Karpinski, Farid M. Ablayev, 1996, ICALP.

A Communication Approach to the Superposition Problem

Farid M. Ablayev, Svetlana Ablayeva, 2010, Fundam. Informaticae.

Computing quantum hashing in the model of quantum branching programs

Alexander Vasiliev, Farid M. Ablayev, Marat Ablayev, 2018 .

Quantum-Assisted Blockchain

Alexander Vasiliev, Farid M. Ablayev, D. Sapaev, 2018, Lobachevskii Journal of Mathematics.

On classical stimulation of quantum machines

Farid M. Ablayev, Aida Gainutdinova, F. Ablayev, 2005, Other Conferences.

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects

Alexander Vasiliev, Farid M. Ablayev, Marat Ablayev, 2016, Balt. J. Mod. Comput..

Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity

Farid M. Ablayev, F. Ablayev, 1996, Theor. Comput. Sci..

Proceedings of the 5th International Computer Science Symposium on Computer Science --- Theory and Applications, CSR 2010

Ernst W. Mayr, Farid M. Ablayev, 2010 .

Very narrow quantum OBDDs and width hierarchies for classical OBDDs pdf

Kamil Khadiev, Farid M. Ablayev, Abuzer Yakaryilmaz, 2014, DCFS.

On BPP versus NPcoNP for ordered read-once branching programs

Marek Karpinski, Farid M. Ablayev, Rustam Mubarakzjanov, 2001, Theor. Comput. Sci..

Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas

Farid M. Ablayev, Marat Ablayev, 2014, DCFS.

On Quantum Fingerprinting and Quantum Cryptographic Hashing

Farid M. Ablayev, Marat Ablayev, 2018 .

Model of a quantum processing device and a quantum programming framework

Farid M. Ablayev, Alexander Vasiliev, Andrey Urmanchev, 2017 .

Computing Boolean Functions via Quantum Hashing

Alexander Vasiliev, Farid M. Ablayev, 2014, Computing with New Resources.

On the computational power of probabilistic and quantum branching program

Marek Karpinski, Cristopher Moore, Farid M. Ablayev, 2005, Inf. Comput..

Classical Simulation Complexity of Quantum Machines

Farid M. Ablayev, Aida Gainutdinova, F. Ablayev, 2003, FCT.

Lower Bounds for One-way Probabilistic Communication Complexity

Farid M. Ablayev, 1993, ICALP.

Cryptographic quantum hashing

Alexander Vasiliev, Farid M. Ablayev, F. Ablayev, 2014 .

On the Power of Randomized Ordered Branching Programs

Marek Karpinski, Farid M. Ablayev, 1998, Electron. Colloquium Comput. Complex..

Quantum and Stochastic Branching Programs of Bounded Width

Cristopher Moore, Farid M. Ablayev, Chris Pollett, 2002, ICALP.

On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions

Airat Khasianov, Alexander Vasiliev, Farid M. Ablayev, 2008, Electron. Colloquium Comput. Complex..

A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs

Marek Karpinski, Farid M. Ablayev, 1998, Electron. Colloquium Comput. Complex..

Quantum and Stochastic Programs of Bounded Width

Cristopher Moore, Farid M. Ablayev, Chris Pollett, 2002, Electron. Colloquium Comput. Complex..

Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability

Farid M. Ablayev, 1988, MFCS.

On Computational Power of Quantum Read-Once Branching Programs

Alexander Vasiliev, Farid M. Ablayev, 2010, HPC.

A lower bound for integer multiplication on randomized ordered read-once branching programs

Marek Karpinski, Farid M. Ablayev, 2003, Inf. Comput..

Classical and Quantum Computations with Restricted Memory

Kamil Khadiev, Alexander Vasiliev, Farid M. Ablayev, 2018, Adventures Between Lower Bounds and Higher Altitudes.

Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs pdf

Kamil Khadiev, Farid M. Ablayev, Aliya Khadieva, 2017, ArXiv.

Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations

Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev, 2020, CSR.

О реализации булевых функций в квантовых ветвящихся программах методом отпечатков@@@On quantum realisation of Boolean functions by the fingerprinting technique

Alexander Vasiliev, Farid M. Ablayev, Фарид Мансурович Аблаев, 2009 .

On Complexity of Regular (1, +k)-Branching Programs

Farid M. Ablayev, 2000, ICALP Satellite Workshops.

Proceedings of the 5th international conference on Computer Science: theory and Applications

Ernst W. Mayr, Farid M. Ablayev, 2010 .

The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach

Farid M. Ablayev, F. Ablayev, 2005, SAGA.

Quantum Hashing via Classical ε-universal Hashing Constructions pdf

Farid M. Ablayev, Marat Ablayev, 2014, ArXiv.

A Discrete Approximation and Communication Complexity Approach to the Superposition Problem

Farid M. Ablayev, Svetlana Ablayeva, F. Ablayev, 2001, FCT.

Proceedings CSR 2010 Workshop on High Productivity Computations: Preface

Alexander Vasiliev, Farid M. Ablayev, Bob Coecke, 2011 .

Possibilities of Probabilistic on-line Counting Machines

Farid M. Ablayev, 1987, FCT.

Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test

Andris Ambainis, Kamil Khadiev, Farid M. Ablayev, 2017, SOFSEM.

Extension of the hierarchy for k-OBDDs of small width

Kamil Khadiev, Farid M. Ablayev, 2013 .

Quantum hashing via ∈-universal hashing constructions and classical fingerprinting

Farid M. Ablayev, Marat Ablayev, F. Ablayev, 2015 .