E. G. Coffman - Publications

  1. A General Purpose Time-Sharing System, E. G. Coffman, Jr., J. I. Schwartz and C. Weissman, AFIPS Conf. Proc. (1964 SJCC), Sparton Books, Baltimore, 347-411. (Best Paper award).
  2. Potentials in Large-Scale Time-Sharing Systems, E. G. Coffman, Jr., J. I. Schwartz and C. Weissman, Proc. 2nd Congress, Information Systems and Sciences, Spartan Books, Baltimore, November 1964.
  3. Interarrival Statistics for Time Sharing Systems, E. G. Coffman, Jr. and R. C. Wood, Comm. Assoc. Comp. Mach. 14 (1966), 500-503.
  4. The Study of Multiprogramming Systems, E. G. Coffman, Jr., Datamation, 1966.
  5. Bounds on Parallel-Processing of Queues with Multiple Phase Jobs, E. G. Coffman, Jr., Naval Res. Log. Quart. 14 (1967), 345-366.
  6. Distribution of Attained Service in Time-Sharing Systems, E. G. Coffman, Jr. and L. Kleinrock, J. Comp. Sys. Sci. 1 (1967), 287-298.
  7. A Probability Model Yielding Performance Bounds for Paging Systems, E. G. Coffman, Jr., IEEE Trans. on Comp. C-17 (1968), 86-89.
  8. Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping, E. G. Coffman, Jr., J. Assoc. Comp. Mach. 15 (1968), 341-353.
  9. An Analysis of Computer Operations under Running-Time Priority Disciplines, E. G. Coffman, Jr., Interactive Systems for Experimental and Applied Mathematics, M. Klerer and J. Reinfelds (editors), Academic Press, November 1968, 257-270.
  10. Computer Scheduling Methods and Their Countermeasures, E. G. Coffman, Jr. and L. Kleinrock, AFIPS Conf. Proc. 32 (1968 SJCC), 11-21.
  11. On the Motion of an Unbounded Markov Queue in Random Access Storage, E. G. Coffman, Jr. and A. C. McKellar, IEEE Trans. Comp. C-17 (1968), 600-603.
  12. A Random Walk Model of a Queue Storage Problem, E. G. Coffman, Jr. and M. Schmookler, IEEE Trans. Comp. C-17 (1968), 1093-1094.
  13. Further Experimental Data on the Behavior of Programs in a Paged Computer System, E. G. Coffman, Jr. and L. Varian, Comm. Assoc. Comp. Mach. 11 (1968), 471-474. Also Proc. First ACM Symp. Operating System Principles, May 1968.
  14. Feedback Queueing Models for Time-Shared Systems, E. G. Coffman, Jr. and L. Kleinrock, J. Assoc. Comp. Mach. 15 (1968), 549-576. Also Proc. Fifth International Teletraffic Congress.
  15. Analysis of a Drum Input/Output Queue under Scheduled Usage in a Paged Computer System, E. G. Coffman, Jr., J. Assoc. Comp. Mach. 16 (1969), 73-90. Corrigendum: 16 (1969), 646.
  16. On State-Dependent Time Allocation Procedures for Time-Sharing Systems, E. G. Coffman, Jr., Proc. Purdue Centennial Symposium on Information Processing, Purdue University, April 1969.
  17. Markov Chain Analysis of Multiprogrammed Computer Systems, E. G. Coffman, Jr., Naval Res. Log. Quart. 16 (1969), 175-197.
  18. Formal Models of Computer Systems Design, E. G. Coffman, Jr., Proc. 2nd Int. Seminar on Computer Science, Computing Laboratory, University of Newcastle upon Tyne, England, September 1969.
  19. On the Trade-Off Between Response and Preemption Costs in a Foreground-Background Computer Service Discipline, E. G. Coffman, Jr., IEEE Trans. Comp. C-18 (1969), 942-947.
  20. Organizing Matrices and Matrix Operations for Paged Memory Systems, E. G. Coffman, Jr. and A. C. McKellar, Comm. Assoc. Comp. Mach. 12 (1969), 153-164.
  21. Models of Resource Allocation Using Pure Time-Sharing Disciplines, E. G. Coffman, Jr. and R. R. Muntz, Proc. 24th ACM Nat. Conf., August 1969, 217-228.
  22. Optimal Sequencing of Computation Graphs on Two-Processor Systems, E. G. Coffman, Jr. and R. R. Muntz, IEEE Trans. Comp. C-18 (1969), 1014-1020. Also Proc. Allerton Conf. on System and Circuit Theory, October 1968.
  23. On File Structuring for Non-Uniform Access Frequencies, J. L. Bruno and E. G. Coffman, Jr., BIT 10:3 (1970), 443-456.
  24. A Study of Interleaved Memory Systems, G. J. Burnett and E. G. Coffman, Jr., AFIPS Proc. 36 (1970 SJCC), AFIPS Press, Montvale, NJ, 467-474.
  25. File Structures Using Hashing Functions, E. G. Coffman, Jr. and J. Eve, Comm. Assoc. Comp. Mach. 13 (1970), 427-433.
  26. Preemptive Scheduling of Real Time Tasks on Multiprocessor Systems, E. G. Coffman, Jr. and R. R. Muntz, J. Assoc. Comp. Mach. 17 (1970), 324-338. Also Hard Real-Time Systems, J. A. Stankovic and K. Ramamritham, Computer Society Press of the IEEE (1988), 190-204.
  27. Waiting Time Distributions for Processor-Sharing Systems, E. G. Coffman, Jr., R. R. Muntz and H. Trotter, J. Assoc. Comp. Mach. 17 (1970), 123-130.
  28. Detection and Prevention of Deadlocks, E. G. Coffman, Jr. and A. Shoshani, Proc. Third Annual Princeton Conf. on Information Sciences and Systems, March 1970.
  29. Sequencing Tasks in Multiprocess Multiple Resource Systems to Avoid Deadlocks, E. G. Coffman, Jr. and A. Shoshani, Proc. 10th Symp. Switching and Automata Theory, October 1970, 225-233.
  30. A Formal Microprogram Model of Parallelism and Register-Sharing, E. G. Coffman, Jr., Computers and Automata, Symp. Proc. Vol. XXI, Polytechnic Press, Polytechnic Institute of Brooklyn, April 1971, 215-223.
  31. Performance Predictions for Extended Paged Memories, E. G. Coffman, Jr. and B. Randell, Acta Informatica 1 (1971), 1-13.
  32. On the Performance of Interleaved Memories with Multiple-Word Bandwidths, G. J. Burnett, E. G. Coffman, Jr. and R. A. Snowdon, IEEE Trans. Comp. C-20 (1971), 1570-1573.
  33. Priority Paging Algorithms and the Extension Problem, E. G. Coffman, Jr. and N. Jones, Proc. 12th Ann. IEEE Symp. Switching and Automata Theory, October 1971, 177-181.
  34. System Deadlocks, E. G. Coffman, Jr., M. Elphick and A. Shoshani, Computing Surveys 2 (1971), 67-78. Also Distributed Computing: Concepts and Implementations, P. L. Mc Entire, J. G. O'Reilly and R. E. Larsen (editors), IEEE Press, 1984.
  35. Nearly Optimal Binary Search Trees, J. L. Bruno and E. G. Coffman, Jr., Proc. IFIP 71 Congress, North Holland (1972), 99-103.
  36. Consistency of Synchronization Nets Using P and V Operations, J. L. Bruno, E. G. Coffman, Jr. and W. Hosken, Proc. 13th Symp. Switching and Automata Theory Symposium, October 1972, 71-76.
  37. Analysis of Scanning Policies for Reducing Disk Seek Times, E. G. Coffman, Jr., L. A. Klimko and B. Ryan, SIAM J. Comput. 1 (1972), 269-279.
  38. A Study of Storage Partitioning Using a Mathematical Model of Locality, E. G. Coffman, Jr. and T. A. Ryan, Comm. Assoc. Comp. Mach. 15 (1972), 185-190. Also Proc. 3rd ACM Symp. on Operating Systems, October 1971.
  39. Optimal Scheduling of Two-Processor Systems, E. G. Coffman, Jr. and R. L. Graham, Acta Informatica 1 (1972), 200-213. Also Proc. Fifth Annual Princeton Conference on Information Sciences and Systems.
  40. A Combinatorial Problem Related to Interleaved Memories, G. J. Burnett and E. G. Coffman, Jr., J. Assoc. Comp. Mach. 20 (1973), 39-45.
  41. A Comparison of Two Disk Scanning Policies, E. G. Coffman, Jr. and C. J. M. Trumbull, Inf. Proc. Letters 2 (1973), 15-17.
  42. Algorithms for Reducing Mean Flow Times, J. Bruno, E. G. Coffman, Jr. and R. Sethi, Comm. Assoc. Comp. Mach. 17 (1974), 382-387. Also Operating Systems Review 7 (1973), 102-103 (extended abstract).
  43. A Survey of Mathematical Results in Flow-Time Sequencing for Computer Systems, E. G. Coffman, Jr., Proc. GI73, Springer-Verlag, October 1973, 25-46.
  44. Operating Systems Theory, E. G. Coffman, Jr. and P. J. Denning, Prentice-Hall, 1973.
  45. Deadlocks in Computer Systems, E. G. Coffman, Jr., Infotech State-of-the-Art Reports, Infotech Ltd., England, 1973.
  46. Algorithms for Minimizing Mean Flow Time, J. L. Bruno, E. G. Coffman, Jr. and R. Sethi, Proc. IFIPS 74 Congress, North Holland, August 1974, 504-510.
  47. Synthesis of a Feedback Queueing Discipline for Computer Operation, E. G. Coffman, Jr. and J. Michel, J. Assoc. Comp. Mach. 21 (1974), 329-339. Also Proc. 7th Annual Princeton Conference on Information Sciences and Systems, March 1973.
  48. A Problem in Multiprogrammed Storage Allocation, E. G. Coffman, Jr. and T. A. Ryan, IEEE Trans. on Comp. C-23 (1974), 1116-1122.
  49. Scheduling Theory: Complexity and Optimal Algorithms, E. G. Coffman, Jr., Proc. Texas Conf. on Computer Science, November 1975.
  50. Computer and Job-Shop Scheduling Theory, E. G. Coffman, Jr. (editor and co-author), John Wiley & Sons, 1975. Russian and Polish translations.
  51. Analysis of Interleaved Memory Systems Using Blockage Buffers, G. J. Burnett and E. G. Coffman, Jr., Comm. Assoc. Comp. Mach. 18 (1975), 91-95.
  52. Selecting a Scheduling Rule to Meet Pre-Specified Response-Time Demands, E. G. Coffman, Jr. and I. Mitrani, Operating Systems Review 9 (1975), 187-191.
  53. On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server, J. L. Bruno, E. G. Coffman, Jr. and D. B. Johnson, J. Comp. and Sys. Sci. 12 (1976), 319-335.
  54. Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices, R. A. Cody and E. G. Coffman, Jr., J. Assoc. Comp. Mach. 23 (1976), 103-115. Also Proc. 8th Princeton Conf. on Information Sciences and Systems, March 1974.
  55. Algorithms Minimizing Mean Flow Time: Schedule-Length Properties, E. G. Coffman, Jr. and R. Sethi, Acta Informatica 6 (1976), 1-14.
  56. A Generalized Bound on LPT Sequencing, E. G. Coffman, Jr. and R. Sethi, Revue Bleue d'AFCET, (R.A.O. Informatique), 10 (1976), 17-25. Also Computer Performance -- 1976, P. S. Chen and M. Franklin (editors), Assoc. Comput. Mach. (1976), 306-310.
  57. Bin-Packing Problems and Their Applications in Storage and Processor Allocation, E. G. Coffman, Jr., J. Y-T. Leung and D. Ting, Computer Performance, K. M. Chandy and M. Reiser (editors), North Holland (1977), 327-339.
  58. Analysis of a Bin-Packing Algorithm for Reducing Access Times on Drum-Like Storage Devices, R. A. Cody, E. G. Coffman, Jr. and D. B. Johnson, Foundations of Control Engineering, Poznan, Poland, 2 (1977), 119-130.
  59. Flow-Time Sequencing of Independent Tasks on Multiple Processors, E. G. Coffman, Jr. and J. Labetoulle, INFOR (Can. J. Oper. Res. and Inf. Proc.) 15 (1977), 289-307. Also Proc. 9th Hawaiian Conference on Information Sciences, January 1976.
  60. An Application of Bin-Packing to Multiprocessor Scheduling, E. G. Coffman, Jr., M. R. Garey and D. S. Johnson, SIAM J. Comput. 7 (1978), 1-17. (One of SIAM's Best Paper nominations for 1978.)
  61. A Class of FIFO Queues Arising in Computer Systems, E. G. Coffman, Jr. and M. Hofri, Oper. Res. 26 (1978), 864-880.
  62. An Efficient Algorithm for Allocating Paged, Drum-Like Storage, E. G. Coffman, Jr., J. Y-T. Leung and D. B. Johnson, BIT 18 (1978), 52-66. Also Proc. Johns Hopkins Conf. on Inf. Systems and Sciences, April 1977.
  63. Bin Packing: Maximizing the Number of Pieces Packed, E. G. Coffman, Jr., J. Y-T. Leung and D. Ting, Acta Informatica 9 (1978), 263-271.
  64. Deterministic Sequencing: Complexity and Optimal Algorithms, E. G. Coffman, Jr., Selected Papers on Operating Systems, M. Arato and E. Knuth (editors), KSH Szamki, Budapest (1978), 159-194.
  65. On the Optimality of Fast Heuristics for Scheduling and Storage Allocation Problems, E. G. Coffman, Jr., J. Y-T. Leung and D. Slutz, Foundations of Control Engineering, Poznan, Poland, 3 (1978).
  66. Markov Models of Parallelism in Loading and Execution of a Single Process, E. G. Coffman, Jr., T. A. Ryan and B. Ryan, Revue Bleue d'AFCET, (R.A.O. Informatique), 13 (1979), 161-174. Also in Computer Architectures and Networks, E. Gelenbe and R. Mahl (editors), North Holland (1974), 375-387.
  67. Bin Packing with a Fixed Number of Bins: An Iterative Algorithm, E. G. Coffman, Jr. and J. Y-T. Leung, SIAM J. Comput. 8 (1979), 202-217. Also Proc. 18th Symp. on the Fundamentals of Computer Science, October 1977, 214-221.
  68. On the Comparison Between Single and Multiple Processor Systems, E. G. Coffman, Jr. and K. So, Proc. 17th IEEE/ACM Symp. on Computer Architecture, May 1980, 72-79.
  69. Orthogonal Packings in Two Dimensions, B. S. Baker, E. G. Coffman, Jr. and R. L. Rivest, SIAM J. Comput. 9 (1980), 846-855. Also, Proc. Allerton Conf. on System and Circuit Theory, October 1980.
  70. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms, E. G. Coffman, Jr., M. R. Garey, D. S. Johnson and R. E. Tarjan, SIAM J. Comput. 9 (1980), 808-826.
  71. A Characterization of Waiting Times Realizable by Single Server Queues, E. G. Coffman, Jr. and I. Mitrani, Oper. Res. 28 (1980), 810-821.
  72. A Stochastic Model of Bin-Packing, E. G. Coffman, Jr., K. So, M. Hofri and A. C. Yao, Information and Control 44 (1980), 105-115.
  73. A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing, B. S. Baker and E. G. Coffman, Jr., SIAM J. Alg. Disc. Math. 2 (1981), 147-152.
  74. Optimization of the Number of Copies in a Distributed Data Base, E. G. Coffman, Jr., E. Gelenbe and B. Plateau, IEEE Trans. Soft. Eng. SE-7 (1981), 78-84.
  75. An Analysis of Parallel-Read, Sequential-Write Systems, E. G. Coffman, Jr., E. Gelenbe, H. O. Pollak and R. Wood, Performance Evaluation 1 (1981), 62-69. Also Performance Evaluation Review 9 (1980), 209-216.
  76. An Introduction to Proof Techniques for Packing and Sequencing Algorithms, E. G. Coffman, Jr., Deterministic and Stochastic Scheduling, M. A. H. Dempster, et. al. (editors), Reidel, Amsterdam (1982), 245-270.
  77. A Data Base Replication Analysis Using an M/M/m Queue with Service Interruptions, F. Baccelli and E. G. Coffman, Jr., Performance Evaluation Review 11 (1982), 102-107.
  78. A Two-Dimensional Bin-Packing Model of Preemptive FIFO Storage Allocation, B. S. Baker and E. G. Coffman, Jr., J. Algorithms 3 (1982), 303-316.
  79. On The Expected Performance of Scanning Disks, E. G. Coffman, Jr. and M. Hofri, SIAM J. Comput. 11 (1982), 60-70. Also Proc. 3rd Int. Symp. on Performance Evaluationi, 1977.
  80. Instruction Sets for Evaluating Arithmetic Expressions, E. G. Coffman, Jr. and R. Sethi, J. Assoc. Comp. Mach. 30 (1983), 457-478.
  81. An Introduction to Combinatorial Models of Dynamic Storage Allocation, E. G. Coffman, Jr., SIAM Review 25 (1983), 311-325.
  82. Dynamic Bin-Packing, E. G. Coffman, Jr., M. R. Garey and D. S. Johnson, SIAM J. Comput. 12 (1983), 227-258. (One of SIAM's Best Paper nominations for 1983.)
  83. Diffusion Approximations for Storage Processes in Computer Systems, E. G. Coffman, Jr. and M. I. Reiman, Performance Evaluation Review, Special Issue, August 1983, 93-117.
  84. Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle, B. S. Baker, A. R. Calderbank, E. G. Coffman, Jr. and J. C. Lagarias, SIAM J. Alg. Disc. Meth. 4 (1983), 383-397.
  85. Insertion and Compaction Algorithms in Sequentially Allocated Storage, B. S. Baker and E. G. Coffman, Jr., SIAM J. Comput. 13 (1984), 600-609.
  86. Dynamic Storage Allocation in Two or More Dimensions, E. G. Coffman, Jr. and E. N. Gilbert, Information and Control 61 (1984), 1-14.
  87. Approximation Algorithms for Bin-Packing, E. G. Coffman, Jr., M. R. Garey and D. S. Johnson, Algorithm Design for Computer Systems Design, G. Ausiello, M. Lucertini and P. Serafini (editors), Springer-Verlag (1984), 49-106.
  88. Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors, E. G. Coffman, Jr., G. N. Frederickson and G. S. Lueker, Math. Oper. Res. 9 (1984), 260-266.
  89. Expected Makespans of Largest-First Sequences, E. G. Coffman, Jr., L. Flatto and G. S. Lueker, Performance `84, E. Gelenbe (editor), North Holland (1984), 491-506.
  90. A Performance Guarantee for Greedy Set Partitioning, E. G. Coffman, Jr. and M. A. Langston, Acta Informatica 21 (1984), 409-415.
  91. Diffusion Approximations for Computer/Communication Systems, E. G. Coffman, Jr. and M. I. Reiman, Mathematical Computer Performance and Reliability, G. Iazeolla, P.-J. Courtois and A. Hordijk (editors), North Holland (1984), 33-53.
  92. Optimum Head Separation in a Disk System with Two Read/Write Heads, A. R. Calderbank, E. G. Coffman, Jr. and L. Flatto, J. Assoc. Comp. Mach. 31 (1984), 826-838.
  93. Recent Progress in the Performance Evaluation of Fundamental Allocation Algorithms, E. G. Coffman, Jr., Performance Evaluation Review 12 (1984), 2-6.
  94. A Stochastic Optimization Algorithm for Minimizing Expected Flow Times on Uniform Machines, A. Agrawala, E. G. Coffman, Jr., M. R. Garey and S. Tripathi, IEEE Trans. Comp. C-33 (1984), 351-356.
  95. Permuting Elements within Columns to Minimize the Maximum Row Sum of a Matrix, E. G. Coffman, Jr. and M. Yannakakis, Math. Oper. Res. 9 (1984), 384-390.
  96. A Stochastic Model of Fragmentation in Dynamic Storage Allocation, E. G. Coffman, Jr., T. T. Kadota and L. A. Shepp, SIAM J. Comput. 14 (1985), 416-425.
  97. On the Asymptotic Optimality of First-Fit Storage Allocation, E. G. Coffman, Jr., T. T. Kadota and L. A. Shepp, IEEE Trans. Soft. Eng. SE-11 (1985), 235-239.
  98. Sequencing Problems in Two-Server Systems, A. R. Calderbank, E. G. Coffman, Jr. and L. Flatto, Math. Oper. Res. 10 (1985), 595-598.
  99. Algorithms for Resolving Conflicts in Dynamic Storage Allocation, B. S. Baker, E. G. Coffman, Jr. and D. E. Willard, J. Assoc. Comp. Mach. 2 (1985), 327-343.
  100. Expected Relative Performance of List Scheduling Rules, E. G. Coffman, Jr. and E. N. Gilbert, Oper. Res. 33 (1985), 548-561.
  101. Scheduling File Transfers, E. G. Coffman, Jr., M. R. Garey, D. S. Johnson and A. S. LaPaugh, SIAM J. Comput. 14 (1985), 744-780. Also Proc. 2nd Ann. ACM Symp. Principles of Distributed Computing, (1983), 254-266.
  102. Sequencing Two Servers on the Sphere, A. R. Calderbank, E. G. Coffman, Jr. and L. Flatto, Stochastic Modeling 1:1 (1985), 17-28.
  103. A Continuous Polling System with Constant Service Times, E. G. Coffman, Jr. and E. N. Gilbert, IEEE Trans. on Information Th. IT-32 (1986), 584-591.
  104. A Provably Efficient Algorithm for Dynamic Storage Allocation, E. G. Coffman, Jr. and F. T. Leighton, J. Comp. Sys. Sci. 8 (1989), 2-35. Also in Proc. ACM Symp. on Th. of Comput. (1986), 77-90.
  105. Stochastic Analysis of Storage Fragmentation, E. G. Coffman, Jr., T. T. Kadota, F. T. Leighton and L. A. Shepp, Proc. Int. Seminar on Teletraffic Analysis and Computer Performance Evaluation, O. J. Boxma, J. W. Cohen and H. C. Tijms (editors), North Holland (1986), 275-295.
  106. Queueing Models of Secondary Storage Devices, E. G. Coffman, Jr. and M. Hofri, Queueing Sys. Th. and Applic. 2 (1986), 129-168.
  107. Sojourn Times in a Tandem Queue with Overtaking: Reduction to a Boundary Value Problem, E. G. Coffman, Jr., G. Fayolle and I. Mitrani, Stochastic Models 2 (1986), 43-65.
  108. The Forwarding Index of Communication Networks, F. R. K. Chung, E. G. Coffman, Jr., M. L. Reiman and B. Simon, IEEE Trans. on Information Th. IT-33 (1987), 224-232.
  109. Stochastic Models of Computer Storage, O. I. Aven, E. G. Coffman, Jr. and Y. A. Kogan, Reidel, Amsterdam, 1987.
  110. Minimizing Expected Makespans on Uniform Processor Systems, E. G. Coffman, Jr., L. Flatto, M. R. Garey and R. R. Weber, Adv. Appl. Prob. 19 (1987), 177-201.
  111. Optimal Selection of Stochastic Intervals under a Sum Constraint, E. G. Coffman, Jr., L. Flatto and R. R. Weber, Adv. Appl. Prob. 19 (1987), 454-473.
  112. Bin-Packing with Divisible Item Sizes, E. G. Coffman, Jr., M. R. Garey and D. S. Johnson, J. Complexity 3 (1987), 406-428.
  113. Polling and Greedy Servers on a Line, E. G. Coffman, Jr. and E. N. Gilbert, Queueing Sys., Th. and Applic. 2 (1987), 115-145.
  114. Two Queues with Alternating Service, E. G. Coffman, Jr., G. Fayolle and I. Mitrani, Performance `87, North Holland (1987), 227-239.
  115. Performance Analysis of a Buffer under Locking Protocols, E. G. Coffman, Jr., L. Flatto and D. P. Gaver, Proc. 4th International Conference on Modeling Techniques and Tools for Computer Performance Evaluation, University of the Balearic Islands (1988), 213-232.
  116. Analysis of a Conveyor Queue in a Flexible Manufacturing System, E. G. Coffman, Jr., E. Gelenbe and E. N. Gilbert, Eur. J. Oper. Res. 35 (1988), 382-392. Also Performance Evaluation Review 14 (1986), 204-223.
  117. Storage of the Single Server Queue, E. G. Coffman, Jr. and I. Mitrani, Queueing Theory and Its Applications, O. J. Boxma and R. Syski (editors), CWI Monographs, North Holland (1988), 193-205.
  118. Stochastic Models of Queue Storage, E. G. Coffman, Jr., L. Flatto, C. Knessl, I. Mitrani and L. A. Shepp, Prob. Eng. and Inf. Sci. 2 (1988), 75-93.
  119. Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics, E. G. Coffman, Jr., G. S. Lueker and A. H. G. Rinnooy Kan, Manag. Sci. 34 (1988), 266-290.
  120. Optimal Directory Placement on Disk Storage Devices, A. R. Calderbank, E. G. Coffman, Jr. and L. Flatto, J. Assoc. Comp. Mach. 35 (1988), 433-446.
  121. Scheduling Stochastic Jobs With a Two-Valued Distribution on Two Parallel Processors, E. G. Coffman, Jr., M. Hofri and G. Weiss, Prob. Eng. Inf. Sci. 3 (1989), 89-116.
  122. Algorithms for Square Packing: A Probabilistic Analysis, E. G. Coffman, Jr. and J. C. Lagarias, SIAM J. Comput. 18 (1989), 166-185.
  123. Tandem Conveyor Queues, F. Baccelli, E. G. Coffman, Jr. and E. N. Gilbert, Prob. Eng. Inf. Sci. 3 (1989), 517-536.
  124. Optimal Scheduling of Products with Two Subassemblies on a Single Machine, E. G. Coffman, Jr., A. Nozari and M. Yannakakis, Oper. Res. 37 (1989), 426-436.
  125. A Note Extending the Analysis of Two-Head Disk Systems to More Realistic Seek-Time Characteristics, A. R. Calderbank, E. G. Coffman, Jr. and L. Flatto, IEEE Trans. Comp. 38 (1989), 1584-1586.
  126. First-Fit Allocation of Queues: Tight Asymptotic Bounds on Expected Wasted Space, E. G. Coffman, Jr., L. Flatto and F. T. Leighton, Stoch. Proc. Applic. 36 (1990), 311-330. Also Proc. 1st Ann. Symp. Disc. Alg., 1990.
  127. Batch Sizing and Job Sequencing on a Single Machine, E. G. Coffman, Jr., M. Yannakakis, M. J. Magazine and C. Santos, Ann. Oper. Res. 26 (1990), 135-147.
  128. Packings in Two Dimensions: Asymptotic Average Case Analysis of Algorithms, E. G. Coffman, Jr. and P. W. Shor, Algorithmica (to appear).
  129. Optimal Strategies for Scheduling Checkpoints and Preventive Maintenance, E. G. Coffman, Jr. and E. N. Gilbert, IEEE Trans. Reliability 39 (1990), 9-18.
  130. Largest-First Sequential Selection with a Sum Constraint, E. G. Coffman, Jr., G. Fayolle, P. Jacquet and P. Robert, Op. Res. Letters 9 (1990), 141-146.
  131. A Simple Proof of the O(sqrt{n} log3/4n) Up-Right Matching Bound, E. G. Coffman, Jr. and P. W. Shor, SIAM J. Disc. Math., February 1991, 48-57.
  132. Average-Case Analysis of Cutting and Packing in Two Dimensions, E. G. Coffman, Jr. and P. W. Shor, Eur. J. Oper. Res. 44 (1990), 134-144.
  133. Probabilistic Analysis of Packing and Partitioning Algorithms, E. G. Coffman, Jr. and G. S. Lueker, Wiley & Sons, 1991.
  134. Service with a Queue and a Cart, E. G. Coffman, Jr. and E. N. Gilbert, Manag. Sci. 38 (1992), 867-883.
  135. Controlled Stochastic Model of a Communication System with Multiple Sources, E. G. Coffman, Jr., B. M. Igelnik and Y. A. Kogan, IEEE Trans. Information Th. 37 (1991), 1379-1387. Also, Proc. International Teletraffic Congress, June 1991.
  136. Storage Limited Queues in Heavy Traffic, E. G. Coffman, Jr., A. A. Puhalsky and M. I. Reiman, Prob. Eng. Inf. Sci. 5 (1991), 499-522.
  137. Optimal Scheduling of Jobs with Out-Forest Precedence Constraints, E. G. Coffman, Jr. and Z. Liu, Oper. Res. 40 (1992), Supplement 1, S67-S75.
  138. Analysis of a Slotted Communication Channel with Next-Fit Message Assignment, E. G. Coffman, Jr., S. Halfin, A. Jean-Marie and P. Robert, IEEE Trans. Inf. Th. 39(1993), 1555-1566.
  139. Stochastic Analysis of a Slotted FIFO Communication Channel: Constant and Uniform Message Lengths, E. G. Coffman, Jr., S. Halfin, A. Jean-Marie and P. Robert, Proc. 4th Internat'l Conf. Data Comm. Sys., Barcelona, 1990.
  140. Height Distributions in a Buffer Model with Locking Protocols, E. G. Coffman, Jr., L. Flatto and D. P. Gaver, Jr., Stochastic Models 7 (1991), 243-260.
  141. Optimal Strategies for Scheduling Tests and Saves, L. B. Boguslavsky, E. G. Coffman, Jr. and A. Y. Kreinin, Proc. 13th Ann. Internat. Conf. Fault-Tolerant Systems and Diagnostics, Varna, Bulgaria, June 1990.
  142. Scheduling Checks and Saves, L. B. Boguslavsky, E. G. Coffman, Jr., E. N. Gilbert and A. Y. Kreinin, ORSA J. Comput. 4 (1992), 60-69.
  143. A Distributed Clustering Process, E. G. Coffman, Jr., P.-J. Courtois, E. N. Gilbert and P. Piret, J. Appl. Prob. 28 (1991), 737-750.
  144. Optimal Stochastic Allocation of Machines under Waiting-Time Constraints, E. G. Coffman, Jr., L. Flatto and P. E. Wright, SIAM J. Comput. 22 (1993), 332-348.
  145. Stochastic Machine Minimization with Constant Service Times, E. G. Coffman, Jr., L. Flatto and P. E. Wright, Math. Oper. Res. 18 (1993), 300-316.
  146. Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling, E. G. Coffman, Jr. and M. R. Garey, Proc. ACM Symp. Th. Comput., ACM Press, 1991, 241-248. Also, J. Assoc. Comput. Mach. 40 (1993), 991-1018.
  147. Paths through a Maze of Rectangles, E. G. Coffman, Jr. and E. N. Gilbert, Networks 22 (1992), 349-367.
  148. Average-Case Performance of One-Dimensional Bin Packing Algorithms under Discrete Uniform Distributions, E. G. Coffman, Jr., C. A. Courcoubetis, M. R. Garey, D. S. Johnson, L. A. McGeoch, P. W. Shor and M. Yannakakis, Proc. ACM Symp. Th. Comput., ACM Press, 1991, 230-240.
  149. Gated, Exhaustive, Parallel Service, S. Browne, E. G. Coffman, Jr., E. N. Gilbert and P. E. Wright, Prob. Eng. Inf. Sci. 6 (1992), 217-239.
  150. Asymptotic Probabilistic Analysis of Packing and Related Partitioning Problems, E. G. Coffman, Jr., D. S. Johnson, G. S. Lueker and P. W. Shor, National Acad. Sci. Report, Study Group on Probability and Algorithms, 1992. Also in Stat. Sci. 8 (1993), 40-47.
  151. Gated, Exhaustive, Parallel Service -- The Uniform Case, S. Browne, E. G. Coffman, Jr., E. N. Gilbert and P. E. Wright, SIAM J. Appl. Math. 52 (1992), 1751-1762.
  152. Scheduling Saves in Fault Tolerant Computations, E. G. Coffman, Jr., L. Flatto and A. Kreinin, Acta Informatica 30 (1993), 409-423.
  153. Probabilistic Analysis of Algorithms for the Capacitated Routing Problem with Unsplit Demands, J. Bramel, E. G. Coffman, Jr., P. W. Shor and D. Simchi-Levi, Oper. Res. 40 (1992), 1095-1106.
  154. A Selection-Replacement Process on the Circle, E. G. Coffman, Jr., E. N. Gilbert and P. W. Shor, Ann. Appl. Prob. 3 (1993), 802-818.
  155. Polling on Graphs, E. G. Coffman, Jr. and A. Stolyar, Prob. Eng. Inf. Sci. 7 (1993), 209-226.
  156. Average-Case Analysis of FFD and BFD Packing under Discrete Uniform Distributions, E. G. Coffman, Jr., D. S. Johnson, L. A. McGeoch and R. R. Weber, (to appear).
  157. A Stochastic Checkpoint Optimization Problem, E. G. Coffman, Jr., L. Flatto and P. E. Wright, SIAM J. Comput. 22 (1993), 650-659.
  158. Computing, E. G. Coffman, Jr., J. K. Lenstra and Rinnooy Kan (editors), Handbook of Operations Research and Management Science, Vol. 3, North Holland, 1992.
  159. Polling Systems with Zero Switchover Times: A Heavy-Traffic Averaging Principle, E. G. Coffman, Jr., A. A. Pukhalskii and M. I. Reiman, Ann. Appl. Prob. 23 (1995).
  160. Asymptotics of Finite Processor Shared Queues with Reneging, E. G. Coffman, Jr., A. A. Pukhalskii, M. I. Reiman and P. E. Wright, Performance Evaluation 19 (1994), 25-46.
  161. Parking Arcs on the Circle with Applications to One-Dimensional Communication Networks, E. G. Coffman, Jr., C. L. Mallows and B. Poonen, Ann. Appl. Prob. 4 (1994), 1098-1111.
  162. First-Fit Bin Packing: A Tight Bound on Expected Wasted Space, E. G. Coffman, Jr., D. S. Johnson, P. W. Shor and R. R. Weber, Probab. Th. and Related Fields (to appear).
  163. The Processor Minimization Problem with Independent Waiting-Time Constraints, E. G. Coffman, Jr., L. Flatto, B. Poonen and P. E. Wright, Theoretical Comput. Sci. 125 (1994), 3-16.
  164. Markov Chains, Computer Proofs, and Best-Fit Bin Packing, E. G. Coffman, Jr., D. S. Johnson, P. W. Shor and R. R. Weber, Proc. ACM Symp. Th. Comput., 1993, 412-421.
  165. Load Balancing on Two Identical Facilities, E. G. Coffman, Jr. and P. E. Wright, (submitted for publication).
  166. Recent Results in the Probabilistic Analysis of Schedule Makespans, E. G. Coffman, Jr. and W. Whitt, Scheduling Theory and Its Applications, Wiley (1995).
  167. Queues Served by a Rotating Ring, E. G. Coffman, Jr., E. N. Gilbert, A. G. Greenberg, F. T. Leighton, P. Robert and A. Stolyar, Stochastic Models 11 (1995), 371-394.
  168. Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times, E. G. Coffman, Jr., N. Kahale and F. T. Leighton, (submitted for publication).
  169. Scheduling Independent Tasks to Minimize the Makespan on Identical Machines, J. Bruno, E. G. Coffman, Jr. and P. J. Downey, Prob. Eng. Inf. Sci. (to appear).
  170. Packing Random Intervals, E. G. Coffman, Jr., B. Poonen and P. Winkler, Probability Theory and Related Fields (to appear).
  171. Optimal Fault Tolerant Computing on Two Processors, J. Bruno and E. G. Coffman, Jr., (submitted for publication).
  172. Stochastic Limit Laws for Schedule Makespans, E. G. Coffman, Jr., L. Flatto and W. Whitt, Stochastic Models 12 (1996), 215-243.
  173. An Asymptotic Analysis of Closed Queueing Networks with Branching Populations, N. Bayer, E. G. Coffman, Jr. and Y. A. Kogan, (submitted for publication).
  174. Mutual Exclusion Scheduling, B. S. Baker and E. G. Coffman, Jr., Theor. Comput. Sci. (to appear).
  175. Maximizing Job Completion Probability by Processor Shadowing, J. L. Bruno, E. G. Coffman, Jr., P. J. Downey and P. E. Wright, (in preparation).
  176. Processor Rings in Heavy Traffic, E. G. Coffman, Jr., L. Flatto, E. N. Gilbert and A. G. Greenberg, (submitted for publication).
  177. Polling Systems in Heavy Traffic: A Bessel Process Limit, E. G. Coffman, Jr., A. A. Puhalskii and M. I. Reiman, (submitted for publication).
  178. Scheduling Theory and Its Applications, Ph. Chretienne, E. G. Coffman, Jr., J. K. Lenstra and Z. Liu (editors), Wiley, Chichester, England (1995).
  179. Stochastic Makespan Minimization on Parallel Machines with Two-Point Job Running-Time Distributions, S. C. Borst, J. L. Bruno and E. G. Coffman, Jr., (submitted for publication).
  180. Bin Packing Approximation Algorithms: A Survey, E. G. Coffman, Jr., M. R. Garey and D. S. Johnson, Approximation Algorithms for NP-Hard Problems, PWS Publishing Co., Boston, MA (to appear).
  181. The Design of Redialing Services, E. G. Coffman, Jr., E. N. Gilbert and Y. A. Kogan, (submitted for publication).
  182. Dynamic Allocation of Bridge Circuits in Teleconferencing Services, D. Applegate, E. G. Coffman, Jr. and D. S. Johnson, Internal memo. AT&T Proprietary.