Farid M. Ablayev
Orcid: 0000-0002-5592-3211
According to our database1,
Farid M. Ablayev
authored at least 46 papers
between 1986 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
1
2
1
1
1
1
1
2
1
1
1
1
1
3
1
1
1
2
2
3
1
1
1
2
2
1
1
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2020
On quantum methods for machine learning problems part II: Quantum classification algorithms.
Big Data Min. Anal., 2020
Big Data Min. Anal., 2020
Proceedings of the IEEE East-West Design & Test Symposium, 2020
Proceedings of the Computer Science - Theory and Applications, 2020
2018
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test.
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
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
2017
CoRR, 2017
2016
Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects.
Balt. J. Mod. Comput., 2016
2014
Proceedings of the Descriptional Complexity of Formal Systems, 2014
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas.
Proceedings of the Descriptional Complexity of Formal Systems, 2014
Proceedings of the Computing with New Resources, 2014
2011
Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011
2010
Proceedings of the Proceedings CSR 2010 Workshop on High Productivity Computations, 2010
2009
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.
Electron. Colloquium Comput. Complex., 2008
On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions.
Electron. Colloquium Comput. Complex., 2008
2007
Classical Simulation Complexity of Quantum Branching Programs.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007
Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007
2005
Inf. Comput., 2005
The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2005
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.
Inf. Comput., 2003
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003
2002
Electron. Colloquium Comput. Complex., 2002
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
2001
Theor. Comput. Sci., 2001
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001
2000
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
1999
Electron. Colloquium Comput. Complex., 1999
1998
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
1997
Randomization and nondeterminsm are incomparable for ordered read-once branching programs
Electron. Colloquium Comput. Complex., 1997
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs.
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.
Theor. Comput. Sci., 1996
1995
Electron. Colloquium Comput. Complex., 1995
1994
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994
1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
1989
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989
1988
Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988
1987
Proceedings of the Fundamentals of Computation Theory, 1987
1986
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986