Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of G. Falin'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 G. Falin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites G. Falin more than expected).
This network shows the impact of papers produced by G. Falin. 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 G. Falin. The network helps show where G. Falin may publish in the future.
Co-authorship network of co-authors of G. Falin
This figure shows the co-authorship network connecting the top 25 collaborators of G. Falin.
A scholar is included among the top collaborators of G. Falin 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 G. Falin. G. Falin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Artalejo, J.R., G. Falin, & M. J. Lopez‐Herrero. (2002). A second order analysis of the waiting time in the M/G/1 retrial queue. Asia Pacific Journal of Operational Research. 19(2). 131–148.16 indexed citations
Falin, G.. (1990). Monotonicity properties of structurally complex switching systems with losses. Problems of Information Transmission. 25(4). 313–321.2 indexed citations
Falin, G.. (1989). On a single server system with randomly varying service rate. 27(3). 26–28.2 indexed citations
8.
Falin, G.. (1989). Analysis of a buffered floating-threshold hybrid switching system. Problems of Information Transmission. 24(4). 318–323.2 indexed citations
Falin, G.. (1988). Ergodicity, stability, and insensitivity for one class of circuit switching networks. Problems of Information Transmission. 24(1). 56–67.2 indexed citations
12.
Falin, G.. (1987). Multichannel queueing systems with repeated calls under high intensity of repetition. Journal of automata, languages and combinatorics. 23(1). 37–47.9 indexed citations
13.
Falin, G.. (1987). ESTIMATIONS OF AN ERROR FOR APPROXIMATION OF COUNTABLE MARKOV-CHAINS ASSOCIATED WITH REPEATED ORDERS QUENEING MODELS. 12–15.4 indexed citations
Falin, G.. (1984). MULTISERVER FULLY-AVAILABLE SYSTEMS WITH REPEAT CALLS UNDER CONDITIONS OF HEAVY TRAFFIC. Moscow University Computational Mathematics and Cybernetics. 82–85.1 indexed citations
16.
Falin, G.. (1983). CALCULATION OF PROBABILITY CHARACTERISTICS OF A MULTILINE SYSTEM WITH REPEAT CALLS. Moscow University Computational Mathematics and Cybernetics. 43–49.18 indexed citations
17.
Falin, G.. (1981). CALCULATION OF THE LOAD ON A SHARED-USE TELEPHONE INSTRUMENT. Moscow University Computational Mathematics and Cybernetics. 76–80.1 indexed citations
18.
Falin, G.. (1981). ASYMPTOTIC INVARIANCE OF PROBABILITY CHARACTERISTICS OF STRUCTURALLY COMPLEX SWITCHING SYSTEMS WITH LOSSES. Problems of Information Transmission. 17(2). 134–139.2 indexed citations
19.
Falin, G.. (1980). M-G-1 QUEUE WITH REPEATED CALLS IN A HEAVY TRAFFIC. 48–50.2 indexed citations
20.
Falin, G.. (1980). SWITCHING SYSTEMS WITH ALLOWANCE FOR REPEATED CALLS. Problems of Information Transmission. 16(2). 145–151.4 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.