S. Halfin

1.1k total citations · 1 hit paper
19 papers, 733 citations indexed

About

S. Halfin is a scholar working on Management Information Systems, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, S. Halfin has authored 19 papers receiving a total of 733 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Management Information Systems, 7 papers in Computer Networks and Communications and 5 papers in Computational Theory and Mathematics. Recurrent topics in S. Halfin's work include Advanced Queuing Theory Analysis (10 papers), Distributed systems and fault tolerance (3 papers) and Probability and Risk Models (3 papers). S. Halfin is often cited by papers focused on Advanced Queuing Theory Analysis (10 papers), Distributed systems and fault tolerance (3 papers) and Probability and Risk Models (3 papers). S. Halfin collaborates with scholars based in United States, Canada and Netherlands. S. Halfin's co-authors include Ward Whitt, A.D. Gelman, Benjamin Avi-Itzhak, Walter Willinger, Ljiljana Trajković, Andrew Robinson, Ranel E. Erickson and Hanan Luss and has published in prestigious journals such as Operations Research, Transactions of the American Mathematical Society and SIAM Journal on Applied Mathematics.

In The Last Decade

S. Halfin

17 papers receiving 673 citations

Hit Papers

align trajectories

What are hit papers?

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.

Heavy-Traffic Limits for Queues with Many Exponential Servers

1981 519 citations S. Halfin, Ward Whitt Operations Research profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
S. Halfin United States	10	614	293	232	212	87	19	733
N. K. Jaiswal India	12	520 0.8×	230 0.8×	154 0.7×	224 1.1×	83 1.0×	43	833
Clifford W. Marshall United States	4	514 0.8×	184 0.6×	114 0.5×	310 1.5×	103 1.2×	8	662
Linn I. Sennott United States	15	537 0.9×	440 1.5×	331 1.4×	242 1.1×	150 1.7×	28	1.2k
Ralph L. Disney United States	19	609 1.0×	174 0.6×	84 0.4×	326 1.5×	120 1.4×	50	803
Hans Daduna Germany	16	634 1.0×	191 0.7×	93 0.4×	252 1.2×	76 0.9×	77	796
Ilze Ziediņš New Zealand	14	346 0.6×	329 1.1×	196 0.8×	96 0.5×	107 1.2×	44	718
L. D. Servi United States	17	1.0k 1.7×	411 1.4×	447 1.9×	428 2.0×	84 1.0×	45	1.2k
Bara Kim South Korea	16	626 1.0×	283 1.0×	236 1.0×	343 1.6×	97 1.1×	117	860
Kyung C. Chae South Korea	18	758 1.2×	254 0.9×	378 1.6×	349 1.6×	65 0.7×	54	948
Colin E. Bell United States	13	340 0.6×	180 0.6×	116 0.5×	273 1.3×	29 0.3×	27	667

Countries citing papers authored by S. Halfin

Since Specialization

Citations

This map shows the geographic impact of S. Halfin'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 S. Halfin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. Halfin more than expected).

Fields of papers citing papers by S. Halfin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. Halfin. 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 S. Halfin. The network helps show where S. Halfin may publish in the future.

Co-authorship network of co-authors of S. Halfin

This figure shows the co-authorship network connecting the top 25 collaborators of S. Halfin. A scholar is included among the top collaborators of S. Halfin 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 S. Halfin. S. Halfin 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:

19 of 19 papers shown

1.

Gelman, A.D. & S. Halfin. (2002). Analysis of resource sharing in information providing services. 312–316. 20 indexed citations

2.

Gelman, A.D., S. Halfin, & Walter Willinger. (2002). On buffer requirements for store-and-forward video on demand service circuits. 976–980. 10 indexed citations

3.

Trajković, Ljiljana & S. Halfin. (2002). Buffer requirements in ATM networks with leaky buckets. 1. 1616–1620. 1 indexed citations

4.

Avi-Itzhak, Benjamin & S. Halfin. (1995). A method for call admission control in ATM networks with heterogeneous sources. Telecommunication Systems. 4(1). 273–290. 6 indexed citations

5.

Avi-Itzhak, Benjamin & S. Halfin. (1993). Servers in tandem with communication and manufacturing blocking. Journal of Applied Probability. 30(2). 429–437. 2 indexed citations

6.

Avi-Itzhak, Benjamin & S. Halfin. (1993). Servers in tandem with communication and manufacturing blocking. Journal of Applied Probability. 30(2). 429–437. 14 indexed citations

7.

Halfin, S.. (1983). Batch Delays Versus Customer Delays. Bell System Technical Journal. 62(7). 2011–2015. 49 indexed citations

8.

Erickson, Ranel E., S. Halfin, & Hanan Luss. (1982). Optimal Sizing of Records when Divided Messages Can Be Stored in Records of Different Sizes. Operations Research. 30(1). 29–39. 1 indexed citations

9.

Halfin, S. & Ward Whitt. (1981). Heavy-Traffic Limits for Queues with Many Exponential Servers. Operations Research. 29(3). 567–588. 519 indexed citations breakdown →

10.

Halfin, S.. (1981). Distribution of the Interoverflow Time for the GI/G/1 Loss System. Mathematics of Operations Research. 6(4). 563–570. 25 indexed citations

11.

Halfin, S.. (1975). Explicit Construction of Invariant Measures for a Class of Continuous State Markov Processes. The Annals of Probability. 3(5). 7 indexed citations

12.

Halfin, S.. (1975). An Approximate Method for Calculating Delays for a Family of Cyclic-Type Queues. Bell System Technical Journal. 54(10). 1733–1754. 12 indexed citations

13.

Halfin, S.. (1972). Steady-State Distribution for the Buffer Content of an $M /G/1$ Queue with Varying Service Rate. SIAM Journal on Applied Mathematics. 23(3). 356–363. 23 indexed citations

14.

Halfin, S.. (1972). Arbitrarily Complex Corner Polyhedra are Dense in $R^n $. SIAM Journal on Applied Mathematics. 23(2). 157–163. 7 indexed citations

15.

Halfin, S., et al.. (1972). A Priority Queueing Model for a Mixture of Two Types of Customers. SIAM Journal on Applied Mathematics. 23(3). 369–379. 22 indexed citations

16.

Halfin, S.. (1970). An Optimization Method for Cascaded Filters. Bell System Technical Journal. 49(2). 185–190. 11 indexed citations

17.

Halfin, S.. (1970). Simultaneous determination of ordering and amplifications of cascaded subsystems. Journal of Optimization Theory and Applications. 6(5). 356–363. 2 indexed citations

18.

Halfin, S. & Andrew Robinson. (1963). Local partial differential algebra. Transactions of the American Mathematical Society. 109(1). 165–180. 1 indexed citations

19.

Halfin, S. & Andrew Robinson. (1963). Local Partial Differential Algebra. Transactions of the American Mathematical Society. 109(1). 165–165. 1 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