Ed G. Coffman
Affiliations: | Computer Science | Columbia University, New York, NY |
Google:
"Ed Coffman"Cross-listing: Computer Science Tree
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Chen B, Coffman E, Dereniowski D, et al. (2015) Normal-form preemption sequences for an open problem in scheduling theory Journal of Scheduling |
| Coffman EG, Ng CT, Timkovsky VG. (2015) How small are shifts required in optimal preemptive schedules? Journal of Scheduling. 18: 155-163 |
| Coffman E, Margolies R, Winkler P, et al. (2014) Performance evaluation of fragmented structures: A theoretical study Performance Evaluation. 79: 273-286 |
| Coffman E, Robert P, Simatos F, et al. (2012) A performance analysis of channel fragmentation in dynamic spectrum access systems Queueing Systems. 71: 293-320 |
| Coffman EG, Dereniowski D, Kubiak W. (2012) An efficient algorithm for finding ideal schedules Acta Informatica. 49: 1-14 |
| Coffman EG, Csirik J, Rónyai L, et al. (2008) Random-order bin packing Discrete Applied Mathematics. 156: 2810-2816 |
| Baryshnikov Y, Coffman EG, Jelenković P. (2004) Space filling and depletion Journal of Applied Probability. 41: 691-702 |
| Baryshnikov Y, Coffman E, Jelenković P, et al. (2004) Flood search under the California Split rule Operations Research Letters. 32: 199-206 |
| Coffman EG, Sethuraman J, Timkovsky VG. (2003) Ideal preemptive schedules on two processors Acta Informatica. 39: 597-612 |
| Coffman EG, Courcoubetis C, Garey MR, et al. (2002) Perfect packing theorems and the average-case behavior of optimal and online bin packing Siam Review. 44: 95-108 |