Edward G. Coffman

1.8k total citations · 1 hit paper
23 papers, 948 citations indexed

About

Edward G. Coffman is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Edward G. Coffman has authored 23 papers receiving a total of 948 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Industrial and Manufacturing Engineering, 10 papers in Computer Networks and Communications and 5 papers in Management Information Systems. Recurrent topics in Edward G. Coffman's work include Scheduling and Optimization Algorithms (10 papers), Optimization and Search Problems (5 papers) and Advanced Queuing Theory Analysis (5 papers). Edward G. Coffman is often cited by papers focused on Scheduling and Optimization Algorithms (10 papers), Optimization and Search Problems (5 papers) and Advanced Queuing Theory Analysis (5 papers). Edward G. Coffman collaborates with scholars based in United States, Hungary and Poland. Edward G. Coffman's co-authors include Peter J. Denning, Leonard Kleinrock, Brenda S. Baker, Mihalis Yannakakis, Jules I. Schwartz, John Bruno, Clark Weissman, János Csirik, Guy Fayolle and Isi Mitrani and has published in prestigious journals such as Operations Research, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

Edward G. Coffman

23 papers receiving 826 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.

Operating Systems Theory

1973 476 citations Edward G. Coffman, Peter J. Denning Medical Entomology and Zoology profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Edward G. Coffman United States	11	646	273	249	148	114	23	948
Lawrence W. Dowdy United States	13	864 1.3×	76 0.3×	234 0.9×	160 1.1×	330 2.9×	56	1000
Joel Wein United States	19	1.2k 1.9×	918 3.4×	205 0.8×	54 0.4×	160 1.4×	40	1.6k
Tilak Agerwala United States	14	320 0.5×	102 0.4×	201 0.8×	138 0.9×	120 1.1×	38	659
Jeffrey M. Jaffe United States	16	1.3k 2.0×	171 0.6×	121 0.5×	74 0.5×	74 0.6×	41	1.5k
Maciej Drozdowski Poland	18	864 1.3×	557 2.0×	383 1.5×	28 0.2×	233 2.0×	64	1.2k
K. C. Sevcik Canada	15	798 1.2×	72 0.3×	249 1.0×	227 1.5×	242 2.1×	30	962
Giuseppe Serazzi Italy	17	866 1.3×	59 0.2×	293 1.2×	185 1.3×	387 3.4×	68	1.0k
Claude Jard France	17	412 0.6×	135 0.5×	164 0.7×	208 1.4×	252 2.2×	80	1.2k
Charles H. Sauer United States	17	527 0.8×	109 0.4×	114 0.5×	675 4.6×	56 0.5×	30	982

Countries citing papers authored by Edward G. Coffman

Since Specialization

Citations

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

Fields of papers citing papers by Edward G. Coffman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Edward G. Coffman

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

1.

Coffman, Edward G., Dariusz Dereniowski, & Wiesław Kubiak. (2011). An efficient algorithm for finding ideal schedules. Acta Informatica. 49(1). 1–14. 5 indexed citations

2.

Coffman, Edward G., et al.. (2008). Random-order bin packing. Discrete Applied Mathematics. 156(14). 2810–2816. 5 indexed citations

3.

Baryshnikov, Yuliy, et al.. (2008). Self-Organizing Sleep-Wake Sensor Systems. 393–402. 2 indexed citations

4.

Coffman, Edward G. & János Csirik. (2007). A classification scheme for bin packing theory. Acta Cybernetica. 18(1). 47–60. 8 indexed citations

5.

Coffman, Edward G., János Csirik, & Gerhard J. Woeginger. (2002). Approximate solutions to bin packing problems. University of Twente Research Information. 607–615. 18 indexed citations

6.

Bruno, John & Edward G. Coffman. (1997). Optimal fault-tolerant computing on multiprocessor systems. Acta Informatica. 34(12). 881–904. 6 indexed citations

7.

Baker, Brenda S. & Edward G. Coffman. (1996). Mutual exclusion scheduling. Theoretical Computer Science. 162(2). 225–243. 75 indexed citations

8.

Coffman, Edward G., et al.. (1992). Scheduling Checks and Saves. INFORMS Journal on Computing. 4(1). 60–69. 9 indexed citations

9.

Bramel, Julien, Edward G. Coffman, Peter W. Shor, & David Simchi‐Levi. (1992). Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Operations Research. 40(6). 1095–1106. 20 indexed citations

10.

Coffman, Edward G., et al.. (1989). Optimal Scheduling of Products with Two Subassemblies on a Single Machine. Operations Research. 37(3). 426–436. 70 indexed citations

11.

Coffman, Edward G., Guy Fayolle, & Isi Mitrani. (1987). Two Queues with Alternating Service Periods. International Symposium on Computer Modeling, Measurement and Evaluation. 227–239. 30 indexed citations

12.

Coffman, Edward G., Leopold Flatto, & George S. Lueker. (1984). Expected Makespans for Largest-First Multiprocessor Scheduling. International Symposium on Computer Modeling, Measurement and Evaluation. 491–506. 8 indexed citations

13.

Coffman, Edward G. & Martin I. Reiman. (1983). Diffusion Approximations for Computer/Communications Systems. 33–54. 7 indexed citations

14.

Coffman, Edward G. & Micha Hofri. (1977). On Scanning-Disks and the Analysis of their Steady State Behavior. International Symposium on Computer Modeling, Measurement and Evaluation. 251–263. 5 indexed citations

15.

Bruno, John, Edward G. Coffman, & Ravi Sethi. (1974). Algorithms for Minimizing Mean Flow Time.. IFIP Congress. 504–510. 23 indexed citations

16.

Coffman, Edward G. & Peter J. Denning. (1973). Operating Systems Theory. Medical Entomology and Zoology. 476 indexed citations breakdown →

17.

Bruno, John & Edward G. Coffman. (1971). Nearly Optimal Binary Search Trees.. IFIP Congress. 99–103. 9 indexed citations

18.

Coffman, Edward G. & Leonard Kleinrock. (1968). Feedback Queueing Models for Time-Shared Systems. Journal of the ACM. 15(4). 549–576. 61 indexed citations

19.

Kleinrock, Leonard & Edward G. Coffman. (1967). Distribution of attained service in time-shared systems. Journal of Computer and System Sciences. 1(3). 287–298. 15 indexed citations

20.

Schwartz, Jules I., Edward G. Coffman, & Clark Weissman. (1964). A general-purpose time-sharing system. 397–397. 51 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