default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFarid M. Ablayev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j9]Farid M. Ablayev
, Marat Ablayev, Joshua Zhexue Huang, Kamil Khadiev, Nailya Salikhova, Dingming Wu:
On quantum methods for machine learning problems part I: Quantum tools. Big Data Min. Anal. 3(1): 41-55 (2020)- [j8]Farid M. Ablayev, Marat Ablayev, Joshua Zhexue Huang, Kamil Khadiev, Nailya Salikhova, Dingming Wu:
On quantum methods for machine learning problems part II: Quantum classification algorithms. Big Data Min. Anal. 3(1): 56-67 (2020) - [c27]Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev:
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations. CSR 2020: 1-15 - [c26]Farid M. Ablayev, Sergey N. Andrianov, Sergey A. Moiseev, Alexander Vasiliev:
Integrated-Optics Quantum Processor Based on Entangled Photons in Coupled Cavities. EWDTS 2020: 1-4
2010 – 2019
- 2018
- [c25]Farid M. Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev:
Classical and Quantum Computations with Restricted Memory. Adventures Between Lower Bounds and Higher Altitudes 2018: 129-155 - [c24]Farid M. Ablayev, Andris Ambainis, Kamil Khadiev, Aliya Khadieva:
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test. SOFSEM 2018: 197-211 - [i14]D. Sapaev, D. Bulychkov, Farid M. Ablayev, Alexander Vasiliev, Mansur Ziatdinov:
Quantum-Assisted Blockchain. CoRR abs/1802.06763 (2018) - 2017
- [i13]Farid M. Ablayev, Kamil Khadiev, Aliya Khadieva:
Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs. CoRR abs/1703.05015 (2017) - 2016
- [j7]Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev, Mansur Ziatdinov:
Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects. Balt. J. Mod. Comput. 4(4) (2016) - 2014
- [c23]Farid M. Ablayev, Alexander Vasiliev:
Computing Boolean Functions via Quantum Hashing. Computing with New Resources 2014: 149-160 - [c22]Farid M. Ablayev, Marat Ablayev:
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas. DCFS 2014: 42-52 - [c21]Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz:
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. DCFS 2014: 53-64 - [i12]Farid M. Ablayev, Marat Ablayev:
Quantum Hashing via Classical ε-universal Hashing Constructions. CoRR abs/1404.1503 (2014) - [i11]Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz:
Very narrow quantum OBDDs and width hierarchies for classical OBDDs. CoRR abs/1405.7849 (2014) - 2013
- [j6]Farid M. Ablayev, Alexander Vasiliev:
Algorithms for Quantum Branching Programs Based on Fingerprinting. Int. J. Softw. Informatics 7(4): 485-500 (2013) - 2011
- [c20]Farid M. Ablayev, Alexander Vasiliev:
Classical and Quantum Parallelism in the Quantum Fingerprinting Method. PaCT 2011: 1-12 - 2010
- [j5]Farid M. Ablayev, Svetlana Ablayeva:
A Communication Approach to the Superposition Problem. Fundam. Informaticae 104(3): 185-200 (2010) - [c19]Farid M. Ablayev, Alexander Vasiliev:
On Computational Power of Quantum Read-Once Branching Programs. HPC 2010: 1-12 - [e2]Farid M. Ablayev, Ernst W. Mayr:
Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings. Lecture Notes in Computer Science 6072, Springer 2010, ISBN 978-3-642-13181-3 [contents] - [e1]Farid M. Ablayev, Bob Coecke, Alexander Vasiliev:
Proceedings CSR 2010 Workshop on High Productivity Computations, HPC 2010, Kazan, Russia, June 21-22, 2010. EPTCS 52, 2010 [contents]
2000 – 2009
- 2009
- [c18]Farid M. Ablayev, Alexander Vasiliev:
Algorithms for Quantum Branching Programs Based on Fingerprinting. DCM 2009: 1-11 - 2008
- [i10]Farid M. Ablayev, Airat Khasianov, Alexander Vasiliev:
On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions. Electron. Colloquium Comput. Complex. TR08 (2008) - [i9]Farid M. Ablayev, Alexander Vasiliev:
On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c17]Farid M. Ablayev, Aida Gainutdinova:
Classical Simulation Complexity of Quantum Branching Programs. LATA 2007: 49-56 - [i8]Farid M. Ablayev:
Classical Simulation Complexity of Quantum Branching Programs. Algebraic Methods in Computational Complexity 2007 - 2005
- [j4]Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett:
On the computational power of probabilistic and quantum branching program. Inf. Comput. 203(2): 145-162 (2005) - [c16]Farid M. Ablayev, Aida Gainutdinova:
Complexity of Quantum Uniform and Nonuniform Automata. Developments in Language Theory 2005: 78-87 - [c15]Farid M. Ablayev:
The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach. SAGA 2005: 190-201 - 2003
- [j3]Farid M. Ablayev, Marek Karpinski:
A lower bound for integer multiplication on randomized ordered read-once branching programs. Inf. Comput. 186(1): 78-89 (2003) - [c14]Farid M. Ablayev, Aida Gainutdinova:
Classical Simulation Complexity of Quantum Machines. FCT 2003: 296-302 - 2002
- [c13]Farid M. Ablayev, Cristopher Moore, Chris Pollett:
Quantum and Stochastic Branching Programs of Bounded Width. ICALP 2002: 343-354 - [i7]Chris Pollett, Farid M. Ablayev, Cristopher Moore:
Quantum and Stochastic Programs of Bounded Width. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j2]Farid M. Ablayev, Marek Karpinski, Rustam Mubarakzjanov:
On BPP versus NPcoNP for ordered read-once branching programs. Theor. Comput. Sci. 264(1): 127-137 (2001) - [c12]Farid M. Ablayev, Svetlana Ablayeva:
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem. FCT 2001: 47-58 - [c11]Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski:
On Computational Power of Quantum Branching Programs. FCT 2001: 59-70 - 2000
- [c10]Farid M. Ablayev:
On Complexity of Regular (1, +k)-Branching Programs. ICALP Satellite Workshops 2000: 229-240 - [c9]Farid M. Ablayev, Aida Gainutdinova:
On the Lower Bounds for One-Way Quantum Automata. MFCS 2000: 132-140
1990 – 1999
- 1999
- [i6]Farid M. Ablayev:
On Complexity of Regular (1,+k)-Branching Programs. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [i5]Farid M. Ablayev, Marek Karpinski:
On the Power of Randomized Ordered Branching Programs. Electron. Colloquium Comput. Complex. TR98 (1998) - [i4]Farid M. Ablayev, Marek Karpinski:
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR98 (1998) - [i3]Farid M. Ablayev, Svetlana Ablayeva:
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c8]Farid M. Ablayev:
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs. ICALP 1997: 195-202 - [i2]Farid M. Ablayev:
Randomization and nondeterminsm are incomparable for ordered read-once branching programs. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j1]Farid M. Ablayev:
Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity. Theor. Comput. Sci. 157(2): 139-159 (1996) - [c7]Farid M. Ablayev, Marek Karpinski:
On the Power of Randomized Branching Programs. ICALP 1996: 348-356 - 1995
- [i1]Farid M. Ablayev, Marek Karpinski:
On the Power of Randomized Branching Programs. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [c6]Farid M. Ablayev:
Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach. LFCS 1994: 1-7 - 1993
- [c5]Farid M. Ablayev:
Lower Bounds for One-way Probabilistic Communication Complexity. ICALP 1993: 241-252
1980 – 1989
- 1989
- [c4]Farid M. Ablayev:
On Comparing Probabilistic and Deterministic Automata Complexity of Languages. MFCS 1989: 599-605 - 1988
- [c3]Farid M. Ablayev:
Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability. MFCS 1988: 154-161 - 1987
- [c2]Farid M. Ablayev:
Possibilities of Probabilistic on-line Counting Machines. FCT 1987: 1-4 - 1986
- [c1]Farid M. Ablayev, Rusins Freivalds:
Why Sometimes Probabilistic Algorithms Can Be More Effective. MFCS 1986: 1-14
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
