Farid Ablayev

925 total citations
35 papers, 300 citations indexed

About

Farid Ablayev is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Atomic and Molecular Physics, and Optics. According to data from OpenAlex, Farid Ablayev has authored 35 papers receiving a total of 300 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Artificial Intelligence, 20 papers in Computational Theory and Mathematics and 6 papers in Atomic and Molecular Physics, and Optics. Recurrent topics in Farid Ablayev's work include Quantum Computing Algorithms and Architecture (22 papers), Quantum Information and Cryptography (12 papers) and Complexity and Algorithms in Graphs (10 papers). Farid Ablayev is often cited by papers focused on Quantum Computing Algorithms and Architecture (22 papers), Quantum Information and Cryptography (12 papers) and Complexity and Algorithms in Graphs (10 papers). Farid Ablayev collaborates with scholars based in Russia, Germany and United States. Farid Ablayev's co-authors include Kamil Khadiev, Joshua Zhexue Huang, Dingming Wu, Marek Karpiński, A. V. Vasilyev, Cristopher Moore, Abuzer Yakaryılmaz, Ernst Mayr, С. Н. Андрианов and А. А. Калачев and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Farid Ablayev

29 papers receiving 275 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Farid Ablayev Russia	10	266	161	51	30	27	35	300
Rūsiņš Freivalds Latvia	11	419 1.6×	361 2.2×	51 1.0×	15 0.5×	15 0.6×	55	475
Jennifer Paykin United States	6	213 0.8×	60 0.4×	15 0.3×	32 1.1×	43 1.6×	11	254
Paul F. Christiano United States	5	116 0.4×	79 0.5×	42 0.8×	14 0.5×	39 1.4×	8	210
Stathis Zachos Greece	8	241 0.9×	299 1.9×	32 0.6×	14 0.5×	9 0.3×	17	369
Benny Applebaum Israel	10	317 1.2×	212 1.3×	32 0.6×	19 0.6×	5 0.2×	35	359
Jiřı́ Wiedermann Czechia	9	122 0.5×	143 0.9×	27 0.5×	18 0.6×	5 0.2×	40	231
Anindya De United States	9	177 0.7×	95 0.6×	25 0.5×	4 0.1×	58 2.1×	34	252
Jun Gu Taiwan	9	237 0.9×	81 0.5×	86 1.7×	22 0.7×	157 5.8×	18	346
Noboru Kunihiro Japan	10	403 1.5×	173 1.1×	26 0.5×	77 2.6×	70 2.6×	62	440
Christof Löding Germany	10	203 0.8×	227 1.4×	28 0.5×	19 0.6×	5 0.2×	42	296

Countries citing papers authored by Farid Ablayev

Since Specialization

Citations

This map shows the geographic impact of Farid Ablayev's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Farid Ablayev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Farid Ablayev more than expected).

Fields of papers citing papers by Farid Ablayev

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Farid Ablayev. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Farid Ablayev. The network helps show where Farid Ablayev may publish in the future.

Co-authorship network of co-authors of Farid Ablayev

This figure shows the co-authorship network connecting the top 25 collaborators of Farid Ablayev. A scholar is included among the top collaborators of Farid Ablayev based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Farid Ablayev. Farid Ablayev is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ablayev, Farid, et al.. (2024). Hybrid Classical–Quantum Text Search Based on Hashing. Mathematics. 12(12). 1858–1858. 3 indexed citations

Ablayev, Farid, et al.. (2023). Analysis of the amplitude form of the quantum hash function. SHILAP Revista de lepidopterología. 165(1). 5–15. 1 indexed citations

Ablayev, Farid, et al.. (2022). Multiqudit quantum hashing and its implementation based on orbital angular momentum encoding. Laser Physics Letters. 19(12). 125205–125205. 4 indexed citations

Ablayev, Farid. (2020). Universal Hash Functions from Quantum Procedures. SHILAP Revista de lepidopterología. 162(3). 259–268. 2 indexed citations

Ablayev, Farid, et al.. (2019). On quantum methods for machine learning problems part I: Quantum tools. Big Data Mining and Analytics. 3(1). 41–55. 34 indexed citations

Ablayev, Farid, et al.. (2019). On quantum methods for machine learning problems part II: Quantum classification algorithms. Big Data Mining and Analytics. 3(1). 56–67. 18 indexed citations

Ablayev, Farid, et al.. (2018). Model of a programmable quantum processing unit based on a quantum transistor effect. AIP conference proceedings. 1936. 20014–20014.

Ablayev, Farid, et al.. (2018). Computing quantum hashing in the model of quantum branching programs. AIP conference proceedings. 1936. 20020–20020.

Ablayev, Farid, et al.. (2016). Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects. Baltic Journal of Modern Computing. 4(4). 12 indexed citations

10.

Ablayev, Farid, et al.. (2016). Very narrow quantum OBDDs and width hierarchies for classical OBDDs. Lobachevskii Journal of Mathematics. 37(6). 670–682. 15 indexed citations

11.

Ablayev, Farid, et al.. (2015). Quantum hashing via ∈-universal hashing constructions and classical fingerprinting. Lobachevskii Journal of Mathematics. 36(2). 89–96. 8 indexed citations

12.

Ablayev, Farid, et al.. (2011). On Computational Power of Quantum Read-Once Branching Programs. arXiv (Cornell University). 1 indexed citations

13.

Ablayev, Farid, et al.. (2008). On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting. Electronic colloquium on computational complexity. 15. 5 indexed citations

14.

Ablayev, Farid, et al.. (2008). On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions. Electronic colloquium on computational complexity. 15. 4 indexed citations

15.

Ablayev, Farid. (2006). <title>On computational power of classical and quantum branching programs</title>. Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE. 626401–626401. 1 indexed citations

16.

Ablayev, Farid, et al.. (2005). On the computational power of probabilistic and quantum branching program. Information and Computation. 203(2). 145–162. 19 indexed citations

17.

Ablayev, Farid & Marek Karpiński. (1998). On the Power of Randomized Ordered Branching Programs. Electronic colloquium on computational complexity. 5. 6 indexed citations

18.

Ablayev, Farid. (1997). Randomization and nondeterminsm are incomparable for ordered read-once branching programs. Electronic colloquium on computational complexity. 4. 4 indexed citations

19.

Ablayev, Farid & Marek Karpiński. (1997). A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs. Electronic colloquium on computational complexity. 5.

20.

Ablayev, Farid. (1996). Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science. 157(2). 139–159. 42 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact