E. G. Coffman

11.6k total citations · 4 hit papers
180 papers, 7.6k citations indexed

About

E. G. Coffman is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Management Information Systems. According to data from OpenAlex, E. G. Coffman has authored 180 papers receiving a total of 7.6k indexed citations (citations by other indexed papers that have themselves been cited), including 116 papers in Computer Networks and Communications, 84 papers in Industrial and Manufacturing Engineering and 48 papers in Management Information Systems. Recurrent topics in E. G. Coffman's work include Optimization and Search Problems (56 papers), Scheduling and Optimization Algorithms (52 papers) and Advanced Queuing Theory Analysis (46 papers). E. G. Coffman is often cited by papers focused on Optimization and Search Problems (56 papers), Scheduling and Optimization Algorithms (52 papers) and Advanced Queuing Theory Analysis (46 papers). E. G. Coffman collaborates with scholars based in United States, France and United Kingdom. E. G. Coffman's co-authors include M. R. Garey, John Bruno, David S. Johnson, Ronald Graham, Arie Shoshani, Brenda S. Baker, Richard R. Muntz, Ravi Sethi, Ronald L. Rivest and George S. Lueker and has published in prestigious journals such as Management Science, IEEE Transactions on Information Theory and Communications of the ACM.

In The Last Decade

E. G. Coffman

175 papers receiving 6.8k 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.

Computer and job-shop scheduling theory

1976 786 citations E. G. Coffman, John Bruno profile →
Approximation algorithms for bin packing: a survey

1996 589 citations E. G. Coffman, M. R. Garey et al. profile →
System Deadlocks

1971 535 citations E. G. Coffman, Arie Shoshani et al. profile →
An Application of Bin-Packing to Multiprocessor Scheduling

1978 444 citations E. G. Coffman, M. R. Garey et al. profile →

Peers

Countries citing papers authored by E. G. Coffman

Since Specialization

Citations

This map shows the geographic impact of E. 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 E. 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 E. G. Coffman more than expected).

Fields of papers citing papers by E. G. Coffman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

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

#	Work	Indexed citations
1	Proceedings of the joint international conference on Measurement and modeling of computer systems 2004 ·E. G. Coffman, (unknown), Arif Merchant	1
2	Closed on-line bin packing 2002 ·Acta Cybernetica ·Eyjólfur Ingi Ásgeirsson, Urtzi Ayesta, E. G. Coffman, (unknown), Petar Momčilović, (unknown), (unknown), Z. Wang, (unknown)	4
3	Approximation algorithms for extensible bin packing 2001 ·Symposium on Discrete Algorithms ·E. G. Coffman, George S. Lueker	10
4	The Maximum of a Random Walk and Its Application to Rectangle Packing 1998 ·Probability in the Engineering and Informational Sciences ·E. G. Coffman, Philippe Flajolet, Leopold Flatto, Micha Hofri	18
5	Approximation algorithms for bin packing: a survey breakdown → 1996 ·E. G. Coffman, M. R. Garey, David S. Johnson	589
6	Probabilistic Analysis of Packing and Related Partitioning Problems 1993 ·Statistical Science ·E. G. Coffman, David Johnson, George S. Lueker, Peter W. Shor	12
7	Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling 1991 ·E. G. Coffman, M. R. Garey	3
8	First-fit storage of linear lists: tight probabilistic bounds on wasted space 1990 ·Symposium on Discrete Algorithms ·E. G. Coffman, Leopold Flatto, Frank Thomson Leighton	3
9	First-fit allocation of queues: tight probabilistic bounds on wasted space 1990 ·Stochastic Processes and their Applications ·E. G. Coffman, Leopold Flatto, Frank Thomson Leighton	9
10	A note extending the analysis of two-head disk systems to more general seek-time characteristics 1989 ·IEEE Transactions on Computers ·A.R. Calderbank, E. G. Coffman, Leopold Flatto	6
11	Preemptive scheduling of real-time tasks on multiprocessor systems 1989 ·IEEE Computer Society Press eBooks ·Richard R. Muntz, E. G. Coffman	17
12	Bin packing with divisible item sizes 1987 ·Journal of Complexity ·E. G. Coffman, M. R. Garey, David Johnson	60
13	Optimal selection of stochastic intervals under a sum constraint 1987 ·Advances in Applied Probability ·E. G. Coffman, (unknown), (unknown)	20
14	Dynamic, first-fit packings in two or more dimensions 1984 ·Information and Control ·E. G. Coffman, E. N. Gilbert	7
15	Anaysis of interleaved memory systems using blockage buffers 1975 ·Communications of the ACM ·(unknown), E. G. Coffman	13
16	Scheduling independent tasks to reduce mean finishing-time 1973 ·John Bruno, E. G. Coffman, Ravi Sethi	1
17	Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems 1970 ·Journal of the ACM ·Richard R. Muntz, E. G. Coffman	102
18	Sequencing tasks in multiprocess, multiple resource systems to avoid deadlocks 1969 ·Arie Shoshani, E. G. Coffman	6
19	Models of Pure time-sharing disciplines for resource allocation 1969 ·E. G. Coffman, Richard R. Muntz	8
20	The organization of matrices and matrix operations in a paged multiprogramming environment 1968 ·A. C. McKellar, E. G. Coffman	22

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