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.
Computational algorithms for closed queueing networks with exponential servers
1973577 citationsJeffrey P. BuzenCommunications of the ACMprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Jeffrey P. Buzen
Since
Specialization
Citations
This map shows the geographic impact of Jeffrey P. Buzen'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 Jeffrey P. Buzen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeffrey P. Buzen more than expected).
Fields of papers citing papers by Jeffrey P. Buzen
This network shows the impact of papers produced by Jeffrey P. Buzen. 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 Jeffrey P. Buzen. The network helps show where Jeffrey P. Buzen may publish in the future.
Co-authorship network of co-authors of Jeffrey P. Buzen
This figure shows the co-authorship network connecting the top 25 collaborators of Jeffrey P. Buzen.
A scholar is included among the top collaborators of Jeffrey P. Buzen 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 Jeffrey P. Buzen. Jeffrey P. Buzen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Buzen, Jeffrey P.. (2008). The Improbable Success of Probabilistic Models.. Int. CMG Conference. 21–32.2 indexed citations
3.
Buzen, Jeffrey P.. (2006). New perspectives on benchmarking, modeling and monte carlo simulation: operational analysis 2.0.. Int. CMG Conference. 271–282.1 indexed citations
4.
Buzen, Jeffrey P., et al.. (2005). Bandwidth, Latency, and Physical Reality. Communications of the ACM. 48(1). 11–12.1 indexed citations
Buzen, Jeffrey P.. (1984). A Simple Model of Transaction Processing.. Int. CMG Conference. 835–839.4 indexed citations
13.
Buzen, Jeffrey P. & A. von Mayrhauser. (1982). BEST/1 Analysis of the IBM 3880-13 Cached Storage Controller.. Int. CMG Conference. 156–173.7 indexed citations
14.
Buzen, Jeffrey P., et al.. (1978). BEST/1 - Design of a tool for computer system capacity planning.. 447–455.10 indexed citations
15.
Buzen, Jeffrey P. & Dominique Potier. (1977). Accuracy of Exponential Assumptions in Closed Queueing Models.. Int. CMG Conference. 53–64.3 indexed citations
16.
Denning, Peter J. & Jeffrey P. Buzen. (1977). Operational Analysis of Queueing Networks. Purdue e-Pubs (Purdue University System). 151–172.24 indexed citations
17.
Buzen, Jeffrey P., et al.. (1976). Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation.
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.