| 2010 | SIGMETRICS | Channel fragmentation in dynamic spectrum access systems: a theoretical study. | Edward G. Coffman Jr., Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman |
| 2008 | DCOSS | Stochastic Counting in Sensor Networks, or: Noise Is Good. | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, William Moran |
| 2007 | Broadnets | Retransmission in OBS networks with fiber delay lines. | Kyung Joon Kwak, Edward G. Coffman Jr. |
| 2006 | DNA | On Times to Compute Shapes in 2D Tile Self-assembly. | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boonsit Yimwadsana |
| 2005 | DNA | Self-correcting Self-assembly: Growth Models and the Hammersley Process. | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Nadrian C. Seeman, Teddy Yimwadsana |
| 2004 | DNA | DNA-Based Computation Times. | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic |
| 2001 | SODA | Approximation algorithms for extensible bin packing. | Edward G. Coffman Jr., George S. Lueker |
| 2001 | SIGMETRICS | Controlling the robots of Web search engines. | Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr. |
| 2000 | LATIN | Average-Case Analysis of Retangle Packings. | Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler |
| 1999 | SODA | Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. | Edward G. Coffman Jr., Alexander L. Stolyar |
| 1993 | STOC | Markov chains, computer proofs, and average-case analysis of best fit bin packing. | Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber |
| 1991 | STOC | Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study | Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis |
| 1991 | STOC | Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling | Edward G. Coffman Jr., M. R. Garey |
| 1990 | SODA | First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. | Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton |
| 1987 | PERFORMANCE | Two Queues with Alternating Service Periods. | Edward G. Coffman Jr., Guy Fayolle, Isi Mitrani |
| 1986 | STOC | A Provably Efficient Algorithm for Dynamic Storage Allocation | Edward G. Coffman Jr., Frank Thomson Leighton |
| 1986 | SIGMETRICS | Analysis of a Conveyor Queue in a Flexible Manufacturing System. | Edward G. Coffman Jr., Erol Gelenbe, Edgar N. Gilbert |
| 1984 | PERFORMANCE | Expected Makespans for Largest-First Multiprocessor Scheduling. | Edward G. Coffman Jr., Leopold Flatto, George S. Lueker |
| 1984 | SIGMETRICS | Recent Progress in the Performance Evaluation of Fundamental Allocation Algorithms. | Edward G. Coffman Jr. |
| 1983 | PODC | Scheduling File Transfers in a Distributed Network. | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh |
| 1983 | SIGMETRICS | Diffusion approximations for storage processes in computer systems. | Edward G. Coffman Jr., Martin I. Reiman |
| 1982 | SIGMETRICS | A Data Base Replication Analysis Using an M/M/m Queue with Service Interruptions. | Franois Baccelli, Edward G. Coffman Jr. |
| 1980 | ISCA | On the Comparison Between Single and Multiple Processor Systems. | Edward G. Coffman Jr., Kimming So |
| 1980 | SIGMETRICS | Optimization of the number of copies in a distribution data base. | Edward G. Coffman Jr., Erol Gelenbe, Brigitte Plateau |
| 1980 | SIGMETRICS | Optimal replication of parallel-read, sequential-write systems. | Edward G. Coffman Jr., Erol Gelenbe, Roger C. Wood |
| 1977 | FOCS | Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation | Edward G. Coffman Jr., Joseph Y.-T. Leung |
| 1977 | PERFORMANCE | On Scanning-Disks and the Analysis of their Steady State Behavior. | Edward G. Coffman Jr., Micha Hofri |
| 1976 | SIGMETRICS | A generalized bound on LPT sequencing. | Edward G. Coffman Jr., Ravi Sethi |
| 1975 | SOSP | Selecting a Scheduling Rule that Meets Pre-Specified Response Time Demands. | Edward G. Coffman Jr., Isi Mitrani |
| 1973 | GI | A Survey of Mathematical Results in Flow-Time Scheduling for Computer Systems. | Edward G. Coffman Jr. |
| 1973 | SOSP | Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract). | John L. Bruno, Edward G. Coffman Jr., Ravi Sethi |
| 1972 | FOCS | Consistency of Synchronization Nets using P and V Operations | John L. Bruno, Edward G. Coffman Jr., W. H. Hosken |
| 1971 | FOCS | Priority Paging Algorithms and the Extension Problem | Edward G. Coffman Jr., Neil D. Jones |
| 1971 | SOSP | A Study of Storage Partitioning Using a Mathematical Model (Abstract). | Edward G. Coffman Jr., T. A. Ryan |
| 1970 | FOCS | Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks | Arie Shoshani, Edward G. Coffman Jr. |
| 1967 | SOSP | An empirical study of the behavior of programs in a paging environment. | Lee C. Varian, Edward G. Coffman Jr. |