Travelled to:6 × USA
Collaborated with:T.A.Ryan M.R.Garey F.T.Leighton I.Mitrani D.S.Johnson P.W.Shor R.R.Weber J.L.Bruno R.Sethi C.Courcoubetis L.A.McGeoch M.Yannakakis
Talks about:schedul (3) storag (3) studi (3) case (3) mathemat (2) partit (2) averag (2) proof (2) model (2) time (2)
Person: Edward G. Coffman Jr.
DBLP: Coffman Jr.:Edward_G=
Facilitated 1 volumes:
EdContributed to:
1993199119861975197319721971Wrote 8 papers:
- STOC-1993-CoffmanJSW #analysis #markov #proving
- Markov chains, computer proofs, and average-case analysis of best fit bin packing (EGCJ, DSJ, PWS, RRW), pp. 412–421.
- STOC-1991-CoffmanCGJMSWY #analysis #case study
- Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study (EGCJ, CC, MRG, DSJ, LAM, PWS, RRW, MY), pp. 230–240.
- STOC-1991-CoffmanG #proving #scheduling
- Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling (EGCJ, MRG), pp. 241–248.
- STOC-1986-CoffmanL #algorithm #performance
- A Provably Efficient Algorithm for Dynamic Storage Allocation (EGCJ, FTL), pp. 77–90.
- SOSP-1975-CoffmanM #scheduling
- Selecting a Scheduling Rule that Meets Pre-Specified Response Time Demands (EGCJ, IM), pp. 187–191.
- SOSP-1973-BrunoCS #independence #scheduling
- Scheduling Independent Tasks to Reduce Mean Finishing Time (JLB, EGCJ, RS), pp. 102–103.
- SOSP-J-1973-CoffmanR72 #case study #clustering #locality #using
- A Study of Storage Partitioning Using a Mathematical Model of Locality (EGCJ, TAR), pp. 185–190.
- SOSP-1971-CoffmanR #case study #clustering #using
- A Study of Storage Partitioning Using a Mathematical Model (EGCJ, TAR), pp. 122–129.