Farid M. Ablayev

According to our database, Farid M. Ablayev authored at least 45 papers between 1986 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

Big Data Min. Anal., 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

Big Data Min. Anal., 2020

Integrated-Optics Quantum Processor Based on Entangled Photons in Coupled Cavities.

Farid M. Ablayev, Sergey N. Andrianov, Sergey A. Moiseev, Alexander Vasiliev

Proceedings of the IEEE East-West Design & Test Symposium, 2020

Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations.

Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev

Proceedings of the Computer Science - Theory and Applications, 2020

2018

Quantum-Assisted Blockchain.

D. Sapaev, D. Bulychkov, Farid M. Ablayev, Alexander Vasiliev, Mansur Ziatdinov

CoRR, 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

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Classical and Quantum Computations with Restricted Memory.

Farid M. Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

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

Farid M. Ablayev, Kamil Khadiev, Aliya Khadieva

CoRR, 2017

2016

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects.

Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev, Mansur Ziatdinov

Balt. J. Mod. Comput., 2016

2014

Quantum Hashing via Classical ε-universal Hashing Constructions.

Farid M. Ablayev, Marat Ablayev

CoRR, 2014

Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs.

Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz

Proceedings of the Descriptional Complexity of Formal Systems, 2014

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

Farid M. Ablayev, Marat Ablayev

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Computing Boolean Functions via Quantum Hashing.

Farid M. Ablayev, Alexander Vasiliev

Proceedings of the Computing with New Resources, 2014

2011

Classical and Quantum Parallelism in the Quantum Fingerprinting Method.

Farid M. Ablayev, Alexander Vasiliev

Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011

2010

A Communication Approach to the Superposition Problem.

Farid M. Ablayev, Svetlana Ablayeva

Fundam. Informaticae, 2010

On Computational Power of Quantum Read-Once Branching Programs

Farid M. Ablayev, Alexander Vasiliev

Proceedings of the Proceedings CSR 2010 Workshop on High Productivity Computations, 2010

2009

Algorithms for Quantum Branching Programs Based on Fingerprinting

Farid M. Ablayev, Alexander Vasiliev

Proceedings of the Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, 2009

2008

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

Farid M. Ablayev, Alexander Vasiliev

Electron. Colloquium Comput. Complex., 2008

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

Farid M. Ablayev, Airat Khasianov, Alexander Vasiliev

Electron. Colloquium Comput. Complex., 2008

2007

Classical Simulation Complexity of Quantum Branching Programs.

Farid M. Ablayev, Aida Gainutdinova

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Classical Simulation Complexity of Quantum Branching Programs.

Farid M. Ablayev

Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007

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

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

Farid M. Ablayev

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2005

Complexity of Quantum Uniform and Nonuniform Automata.

Farid M. Ablayev, Aida Gainutdinova

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2003

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

Farid M. Ablayev, Marek Karpinski

Inf. Comput., 2003

Classical Simulation Complexity of Quantum Machines.

Farid M. Ablayev, Aida Gainutdinova

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Quantum and Stochastic Programs of Bounded Width

Chris Pollett, Farid M. Ablayev, Cristopher Moore

Electron. Colloquium Comput. Complex., 2002

Quantum and Stochastic Branching Programs of Bounded Width.

Farid M. Ablayev, Cristopher Moore, Chris Pollett

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

On BPP versus NPcoNP for ordered read-once branching programs.

Farid M. Ablayev, Marek Karpinski, Rustam Mubarakzjanov

Theor. Comput. Sci., 2001

On Computational Power of Quantum Branching Programs.

Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

On the Lower Bounds for One-Way Quantum Automata.

Farid M. Ablayev, Aida Gainutdinova

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

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

Farid M. Ablayev

Electron. Colloquium Comput. Complex., 1999

1998

A Discrete Approximation and Communication Complexity Approach to the Superposition Problem

Farid M. Ablayev, Svetlana Ablayeva

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

On the Power of Randomized Ordered Branching Programs

Farid M. Ablayev, Marek Karpinski

Electron. Colloquium Comput. Complex., 1998

1997

Randomization and nondeterminsm are incomparable for ordered read-once branching programs

Farid M. Ablayev

Electron. Colloquium Comput. Complex., 1997

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

Farid M. Ablayev

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

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

Farid M. Ablayev

Theor. Comput. Sci., 1996

1995

On the Power of Randomized Branching Programs

Farid M. Ablayev, Marek Karpinski

Electron. Colloquium Comput. Complex., 1995

1994

Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach.

Farid M. Ablayev

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993

Lower Bounds for One-way Probabilistic Communication Complexity.

Farid M. Ablayev

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1989

On Comparing Probabilistic and Deterministic Automata Complexity of Languages.

Farid M. Ablayev

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

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

Farid M. Ablayev

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

Possibilities of Probabilistic on-line Counting Machines.

Farid M. Ablayev

Proceedings of the Fundamentals of Computation Theory, 1987

1986

Why Sometimes Probabilistic Algorithms Can Be More Effective.

Farid M. Ablayev, Rusins Freivalds

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986