| 2012 | ||
|---|---|---|
| 147 | Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak: An efficient algorithm for finding ideal schedules. Acta Inf. 49(1): 1-14 (2012) | |
| 146 | Edward G. Coffman Jr.: Synthesis of local-rule processes: successes and challenges (abstract only). SIGMETRICS Performance Evaluation Review 39(4): 24 (2012) | |
| 2011 | ||
| 145 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, Bill Moran: Minimalist counting in sensor networks (Noise helps). Ad Hoc Networks 9(6): 987-997 (2011) | |
| 144 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak: CAUCHY localization: a distributed computation of WSNs. SIGMETRICS Performance Evaluation Review 39(2): 59-61 (2011) | |
| 2010 | ||
| 143 | Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky: A Computational Study of Margining Portfolios of Options by Two Approaches. ICISTM 2010: 325-332 | |
| 142 | Edward G. Coffman Jr., Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman: Channel fragmentation in dynamic spectrum access systems: a theoretical study. SIGMETRICS 2010: 333-344 | |
| 141 | Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky: Strategy vs risk in margining portfolios of options. 4OR 8(4): 375-386 (2010) | |
| 140 | Edward G. Coffman Jr., Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman: Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study CoRR abs/1002.3084: (2010) | |
| 2008 | ||
| 139 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, Bill Moran: Stochastic Counting in Sensor Networks, or: Noise Is Good. DCOSS 2008: 32-45 | |
| 138 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak: High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata. IPSN 2008: 517-526 | |
| 137 | Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.: Cyclic Cellular Automata: A Tool for Self-Organizing Sleep Scheduling in Sensor Networks. IPSN 2008: 535-536 | |
| 136 | Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.: Self-Organizing Sleep-Wake Sensor Systems. SASO 2008: 393-402 | |
| 135 | Edward G. Coffman Jr., Andreas Constantinides: Design of Local-Rule Protocols for Large-Scale File-Sharing Networks. SASO Workshops 2008: 278-283 | |
| 134 | Edward G. Coffman Jr., János Csirik, Lajos Rónyai, Ambrus Zsbán: Random-order bin packing. Discrete Applied Mathematics 156(14): 2810-2816 (2008) | |
| 133 | Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.: Self-assembling sweep-and-sleep sensor systems. SIGMETRICS Performance Evaluation Review 36(2): 131-133 (2008) | |
| 2007 | ||
| 132 | Kyung Joon Kwak, Edward G. Coffman Jr.: Retransmission in OBS networks with fiber delay lines. BROADNETS 2007: 243-249 | |
| 131 | Edward G. Coffman Jr., János Csirik: A Classification Scheme for Bin Packing Theory. Acta Cybern. 18(1): 47-60 (2007) | |
| 2006 | ||
| 130 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boonsit Yimwadsana: On Times to Compute Shapes in 2D Tile Self-assembly. DNA 2006: 215-222 | |
| 129 | Edward G. Coffman Jr., George S. Lueker: Approximation Algorithms for Extensible Bin Packing. J. Scheduling 9(1): 63-69 (2006) | |
| 128 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Jing Feng, Vishal Misra: Free-Drop TCP. SIGMETRICS Performance Evaluation Review 34(3): 33-35 (2006) | |
| 2005 | ||
| 127 | Peggy B. McGee, Steven M. Nowick, Edward G. Coffman Jr.: Efficient performance analysis of asynchronous systems based on periodicity. CODES+ISSS 2005: 225-230 | |
| 126 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Nadrian C. Seeman, Teddy Yimwadsana: Self-correcting Self-assembly: Growth Models and the Hammersley Process. DNA 2005: 1-11 | |
| 2004 | ||
| 125 | Edward G. Coffman Jr., Zhen Liu, Arif Merchant: Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2004, June 10-14, 2004, New York, NY, USA ACM 2004 | |
| 124 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic: DNA-Based Computation Times. DNA 2004: 14-23 | |
| 123 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein: Flood search under the California Split rule. Oper. Res. Lett. 32(3): 199-206 (2004) | |
| 122 | Edward G. Coffman Jr., Andreas Constantinides, Dan Rubenstein, Bruce Shepherd, Angelos Stavrou: Content distribution for seamless transmission. SIGMETRICS Performance Evaluation Review 32(2): 31-32 (2004) | |
| 121 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic: Self assembly times in DNA-based computation. SIGMETRICS Performance Evaluation Review 32(2): 35-37 (2004) | |
| 2003 | ||
| 120 | Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky: Ideal preemptive schedules on two processors. Acta Inf. 39(8): 597-612 (2003) | |
| 119 | Edward G. Coffman Jr.: JACM 1976-1979. J. ACM 50(1): 16 (2003) | |
| 118 | Lachlan L. H. Andrew, Yuliy M. Baryshnikov, Edward G. Coffman Jr., Stephen V. Hanly, Jolyon White: An asymptotically optimal greedy algorithm for large optical burst switching systems. SIGMETRICS Performance Evaluation Review 31(2): 14-16 (2003) | |
| 2002 | ||
| 117 | E. Asgeirsson, Urtzi Ayesta, Edward G. Coffman Jr., J. Etra, Petar Momcilovic, D. Phillips, V. Vokhshoori, Z. Wang, J. Wolfe: Closed On-Line Bin Packing. Acta Cybern. 15(3): 361-367 (2002) | |
| 116 | Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler: Packing rectangles in a strip. Acta Inf. 38(10): 673-693 (2002) | |
| 115 | Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic: The Dyadic Stream Merging Algorithm. J. Algorithms 43(1): 120-137 (2002) | |
| 114 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein: Flood search under the California split strategy. SIGMETRICS Performance Evaluation Review 30(3): 15-16 (2002) | |
| 2001 | ||
| 113 | Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.: Controlling the robots of Web search engines. SIGMETRICS/Performance 2001: 236-244 | |
| 112 | Edward G. Coffman Jr., George S. Lueker: Approximation algorithms for extensible bin packing. SODA 2001: 586-588 | |
| 111 | Edward G. Coffman Jr., Alexander L. Stolyar: Bandwidth Packing. Algorithmica 29(1): 70-88 (2001) | |
| 110 | Sem C. Borst, Edward G. Coffman Jr., Edgar N. Gilbert, Philip A. Whiting, Peter M. Winkler: Optimal Carrier Sharing in Wireless TDMA. Journal of Interconnection Networks 2(2): 189-211 (2001) | |
| 109 | Edward G. Coffman Jr., Predrag R. Jelenkovic: Threshold policies for single-resource reservation systems. SIGMETRICS Performance Evaluation Review 28(4): 9-10 (2001) | |
| 108 | Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic: Kelly's LAN model revisited. SIGMETRICS Performance Evaluation Review 29(3): 28-29 (2001) | |
| 107 | Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.: Optimizing the Number of Robots for Web Search Engines. Telecommunication Systems 17(1-2): 243-264 (2001) | |
| 2000 | ||
| 106 | Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler: Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297 | |
| 105 | Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis: Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. SIAM J. Discrete Math. 13(3): 384-402 (2000) | |
| 1999 | ||
| 104 | Edward G. Coffman Jr., Alexander L. Stolyar: Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. SODA 1999: 877-878 | |
| 103 | Edward G. Coffman Jr., Predrag R. Jelenkovic: Performance of the move-to-front algorithm with Markov-modulated request sequences. Oper. Res. Lett. 25(3): 109-118 (1999) | |
| 102 | Edward G. Coffman Jr., Philippe Robert, Alexander L. Stolyar: The interval packing process of linear networks. SIGMETRICS Performance Evaluation Review 27(3): 3-4 (1999) | |
| 1998 | ||
| 101 | Edward G. Coffman Jr., Leopold Flatto, Predrag R. Jelenkovic, Bjorn Poonen: Packing Random Intervals On-Line. Algorithmica 22(4): 448-476 (1998) | |
| 100 | Edward G. Coffman Jr., Shimon Even: A Note on Limited Preemption. Parallel Processing Letters 8(1): 3-6 (1998) | |
| 99 | Edward G. Coffman Jr., Nabil Kahale, Frank Thomson Leighton: Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. SIAM J. Comput. 27(5): 1221-1236 (1998) | |
| 1997 | ||
| 98 | John L. Bruno, Edward G. Coffman Jr.: Optimal Fault-Tolerant Computing on Multiprocessor Systems. Acta Inf. 34(12): 881-904 (1997) | |
| 97 | Edward G. Coffman Jr., Leopold Flatto, Edgar N. Gilbert, Albert G. Greenberg: An Approximate Model of Processor Communication Rings Under Heavy Load. Inf. Process. Lett. 64(2): 61-67 (1997) | |
| 96 | Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber: Bin packing with discrete item sizes, part II: Tight bounds on First Fit. Random Struct. Algorithms 10(1-2): 69-101 (1997) | |
| 1996 | ||
| 95 | Brenda S. Baker, Edward G. Coffman Jr.: Mutual Exclusion Scheduling. Theor. Comput. Sci. 162(2): 225-243 (1996) | |
| 1994 | ||
| 94 | Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman, Paul E. Wright: Processor-Shared Buffers with Reneging. Perform. Eval. 19(1): 25-46 (1994) | |
| 93 | Edward G. Coffman Jr., Leopold Flatto, Bjorn Poonen, Paul E. Wright: The Processor Minimization Problem with Independent Waiting-Time Constraints. Theor. Comput. Sci. 125(1): 3-16 (1994) | |
| 1993 | ||
| 92 | Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber: Markov chains, computer proofs, and average-case analysis of best fit bin packing. STOC 1993: 412-421 | |
| 91 | Edward G. Coffman Jr., Leopold Flatto, Alexander Y. Kreinin: Scheduling Saves in Fault-Tolerant Computations. Acta Inf. 30(5): 409-423 (1993) | |
| 90 | Edward G. Coffman Jr., Peter W. Shor: Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. Algorithmica 9(3): 253-277 (1993) | |
| 89 | Edward G. Coffman Jr., Shlomo Halfin, Alain Jean-Marie, Philippe Robert: Stochastic analysis of a slotted FIFO communication channel. IEEE Transactions on Information Theory 39(5): 1555-1566 (1993) | |
| 88 | Edward G. Coffman Jr., M. R. Garey: Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. J. ACM 40(5): 991-1018 (1993) | |
| 87 | Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright: Optimal Stochastic Allocation of Machines Under Waiting-Time Constraints. SIAM J. Comput. 22(2): 332-348 (1993) | |
| 86 | Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright: A Stochastic Checkpoint Optimization Problem. SIAM J. Comput. 22(3): 650-659 (1993) | |
| 1992 | ||
| 85 | Leonid B. Boguslavsky, Edward G. Coffman Jr., Edgar N. Gilbert, Alexander Y. Kreinin: Scheduling Checks and Saves. INFORMS Journal on Computing 4(1): 60-69 (1992) | |
| 1991 | ||
| 84 | Edward G. Coffman Jr., George S. Lueker: Probabilistic analysis of packing and partitioning algorithms. Wiley 1991: I-XIV, 1-192 | |
| 83 | Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis: Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study STOC 1991: 230-240 | |
| 82 | Edward G. Coffman Jr., M. R. Garey: Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling STOC 1991: 241-248 | |
| 81 | Edward G. Coffman Jr., B. M. Igelnik, Yakov A. Kogan: Controlled stochastic model of a communication system with multiple sources. IEEE Transactions on Information Theory 37(5): 1379-1387 (1991) | |
| 80 | Edward G. Coffman Jr., Peter W. Shor: A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound. SIAM J. Discrete Math. 4(1): 48-57 (1991) | |
| 1990 | ||
| 79 | Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton: First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. SODA 1990: 272-279 | |
| 1989 | ||
| 78 | A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto: A Note Extending the Analysis of Two-Head Disk Systems to More General Seek-Time Characteristics. IEEE Trans. Computers 38(11): 1584-1586 (1989) | |
| 77 | Edward G. Coffman Jr., Frank Thomson Leighton: A Provably Efficient Algorithm for Dynamic Storage Allocation. J. Comput. Syst. Sci. 38(1): 2-35 (1989) | |
| 76 | Edward G. Coffman Jr., J. C. Lagarias: Algorithms for Packing Squares: A Probabilistic Analysis. SIAM J. Comput. 18(1): 166-185 (1989) | |
| 1988 | ||
| 75 | A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto: Optimal directory placement on disk storage devices. J. ACM 35(2): 433-446 (1988) | |
| 1987 | ||
| 74 | Edward G. Coffman Jr., Guy Fayolle, Isi Mitrani: Two Queues with Alternating Service Periods. Performance 1987: 227-239 | |
| 73 | Fan R. K. Chung, Edward G. Coffman Jr., Martin I. Reiman, Burton Simon: The forwarding index of communication networks. IEEE Transactions on Information Theory 33(2): 224-232 (1987) | |
| 72 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson: Bin packing with divisible item sizes. J. Complexity 3(4): 406-428 (1987) | |
| 71 | Edward G. Coffman Jr., Edgar N. Gilbert: Polling and Greedy Servers on a Line. Queueing Syst. 2(2): 115-145 (1987) | |
| 1986 | ||
| 70 | Edward G. Coffman Jr., Erol Gelenbe, Edgar N. Gilbert: Analysis of a Conveyor Queue in a Flexible Manufacturing System. SIGMETRICS 1986: 204-223 | |
| 69 | Edward G. Coffman Jr., Frank Thomson Leighton: A Provably Efficient Algorithm for Dynamic Storage Allocation STOC 1986: 77-90 | |
| 68 | Edward G. Coffman Jr., Edgar N. Gilbert: A continuous polling system with constant service times. IEEE Transactions on Information Theory 32(4): 584-591 (1986) | |
| 67 | Edward G. Coffman Jr., Micha Hofri: Queueing Models of Secondary Storage Devices. Queueing Syst. 1(2): 129-168 (1986) | |
| 1985 | ||
| 66 | Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp: On the Asymptotic Optimality of First-Fit Storage Allocation. IEEE Trans. Software Eng. 11(2): 235-239 (1985) | |
| 65 | Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard: Algorithms for Resolving Conflicts in Dynamic Storage Allocation J. ACM 32(2): 327-343 (1985) | |
| 64 | Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp: A Stochastic Model of Fragmentation in Dynamic Storage Allocation. SIAM J. Comput. 14(2): 416-425 (1985) | |
| 63 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh: Scheduling File Transfers. SIAM J. Comput. 14(3): 744-780 (1985) | |
| 1984 | ||
| 62 | Edward G. Coffman Jr., Leopold Flatto, George S. Lueker: Expected Makespans for Largest-First Multiprocessor Scheduling. Performance 1984: 491-506 | |
| 61 | Edward G. Coffman Jr.: Recent Progress in the Performance Evaluation of Fundamental Allocation Algorithms. SIGMETRICS 1984: 2-6 | |
| 60 | Edward G. Coffman Jr., Michael A. Langston: A Performance Guarantee for the Greedy Set-Partitioning Algorithm. Acta Inf. 21: 409-415 (1984) | |
| 59 | Ashok K. Agrawala, Edward G. Coffman Jr., M. R. Garey, Satish K. Tripathi: A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors. IEEE Trans. Computers 33(4): 351-356 (1984) | |
| 58 | Edward G. Coffman Jr., Edgar N. Gilbert: Dynamic, First-Fit Packings in Two or More Dimensions Information and Control 61(1): 1-14 (1984) | |
| 57 | A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto: Optimum Head Separation in a Disk System with Two Read/Write Heads. J. ACM 31(4): 826-838 (1984) | |
| 56 | Brenda S. Baker, Edward G. Coffman Jr.: Insertion and Compaction Algorithms in Sequentially Allocated Storage. SIAM J. Comput. 13(3): 600-609 (1984) | |
| 1983 | ||
| 55 | Edward G. Coffman Jr., Martin I. Reiman: Diffusion Approximations for Computer/Communications Systems. Computer Performance and Reliability 1983: 33-54 | |
| 54 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh: Scheduling File Transfers in a Distributed Network. PODC 1983: 254-266 | |
| 53 | Edward G. Coffman Jr., Martin I. Reiman: Diffusion approximations for storage processes in computer systems. SIGMETRICS 1983: 93-117 | |
| 52 | Edward G. Coffman Jr., Ravi Sethi: Instruction Sets for Evaluating Arithmetic Expressions J. ACM 30(3): 457-478 (1983) | |
| 51 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson: Dynamic Bin Packing. SIAM J. Comput. 12(2): 227-258 (1983) | |
| 1982 | ||
| 50 | Brenda S. Baker, Edward G. Coffman Jr.: A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation. J. Algorithms 3(4): 303-316 (1982) | |
| 49 | Edward G. Coffman Jr., Micha Hofri: On the Expected Performance of Scanning Disks. SIAM J. Comput. 11(1): 60-70 (1982) | |
| 48 | François Baccelli, Edward G. Coffman Jr.: A Data Base Replication Analysis Using an M/M/m Queue with Service Interruptions. SIGMETRICS Performance Evaluation Review 11(4): 102-107 (1982) | |
| 1981 | ||
| 47 | Edward G. Coffman Jr., Erol Gelenbe, Brigitte Plateau: Optimization of the Number of Copies in a Distributed Data Base. IEEE Trans. Software Eng. 7(1): 78-84 (1981) | |
| 46 | Edward G. Coffman Jr., H. O. Pollak, Erol Gelenbe, R. C. Wood: An analysis of parallel-read sequential-write systems. Perform. Eval. 1(1): 62-69 (1981) | |
| 1980 | ||
| 45 | Edward G. Coffman Jr., Kimming So: On the Comparison Between Single and Multiple Processor Systems. ISCA 1980: 72-79 | |
| 44 | Edward G. Coffman Jr., Kimming So, Micha Hofri, Andrew Chi-Chih Yao: A Stochastic Model of Bin-Packing Information and Control 44(2): 105-115 (1980) | |
| 43 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms. SIAM J. Comput. 9(4): 808-826 (1980) | |
| 42 | Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest: Orthogonal Packings in Two Dimensions. SIAM J. Comput. 9(4): 846-855 (1980) | |
| 1979 | ||
| 41 | Edward G. Coffman Jr., Joseph Y.-T. Leung: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. SIAM J. Comput. 8(2): 202-217 (1979) | |
| 1978 | ||
| 40 | Edward G. Coffman Jr., Joseph Y.-T. Leung, D. W. Ting: Bin Packing: Maximizing the Number of Pieces Packed. Acta Inf. 9: 263-271 (1978) | |
| 39 | Edward G. Coffman Jr., M. R. Garey, David S. Johnson: An Application of Bin-Packing to Multiprocessor Scheduling. SIAM J. Comput. 7(1): 1-17 (1978) | |
| 1977 | ||
| 38 | Edward G. Coffman Jr., Joseph Y.-T. Leung: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation FOCS 1977: 214-221 | |
| 37 | Edward G. Coffman Jr., Micha Hofri: On Scanning-Disks and the Analysis of their Steady State Behavior. Performance 1977: 251-263 | |
| 1976 | ||
| 36 | Edward G. Coffman Jr., Ravi Sethi: A generalized bound on LPT sequencing. SIGMETRICS 1976: 306-310 | |
| 35 | Edward G. Coffman Jr., Ravi Sethi: Algorithms Minimizing Mean Flow Time: Schedule-Length Properties. Acta Inf. 6: 1-14 (1976) | |
| 34 | R. A. Cody, Edward G. Coffman Jr.: Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices. J. ACM 23(1): 103-115 (1976) | |
| 33 | R. A. Cody, Edward G. Coffman Jr.: Errata: ``Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices''. J. ACM 23(3): 572 (1976) | |
| 32 | John L. Bruno, Edward G. Coffman Jr., D. B. Johnson: On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server. J. Comput. Syst. Sci. 12(3): 319-335 (1976) | |
| 1975 | ||
| 31 | Edward G. Coffman Jr., Isi Mitrani: Selecting a Scheduling Rule that Meets Pre-Specified Response Time Demands. SOSP 1975: 187-191 | |
| 30 | G. J. Burnett, Edward G. Coffman Jr.: Analysis of Interleaved Memory Systems Using Blockage Buffers. Commun. ACM 18(2): 91-95 (1975) | |
| 1974 | ||
| 29 | John L. Bruno, Edward G. Coffman Jr., Ravi Sethi: Algorithms for Minimizing Mean Flow Time. IFIP Congress 1974: 504-510 | |
| 28 | John L. Bruno, Edward G. Coffman Jr., Ravi Sethi: Scheduling Independent Tasks to Reduce Mean Finishing Time. Commun. ACM 17(7): 382-387 (1974) | |
| 27 | J. A. Michel, Edward G. Coffman Jr.: Synthesis of a Feedback Queueing Discipline for Computer Operation. J. ACM 21(2): 329-339 (1974) | |
| 1973 | ||
| 26 | Edward G. Coffman Jr., Peter J. Denning: Operating Systems Theory Prentice-Hall 1973 | |
| 25 | Edward G. Coffman Jr.: A Survey of Mathematical Results in Flow-Time Scheduling for Computer Systems. GI Jahrestagung 1973: 25-46 | |
| 24 | John L. Bruno, Edward G. Coffman Jr., Ravi Sethi: Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract). SOSP 1973: 102-103 | |
| 23 | Edward G. Coffman Jr.: A Note on the Relative Performance of Two Disk Scanning Policies. Inf. Process. Lett. 2(1): 15-17 (1973) | |
| 22 | G. J. Burnett, Edward G. Coffman Jr.: A Combinatorial Problem Related to Interleaved Memory Systems. J. ACM 20(1): 39-45 (1973) | |
| 1972 | ||
| 21 | John L. Bruno, Edward G. Coffman Jr., W. H. Hosken: Consistency of Synchronization Nets using P and V Operations SWAT (FOCS) 1972: 71-77 | |
| 20 | Edward G. Coffman Jr., Ronald L. Graham: Optimal Scheduling for Two-Processor Systems. Acta Inf. 1: 200-213 (1972) | |
| 19 | Edward G. Coffman Jr., T. A. Ryan: A Study of Storage Partitioning Using a Mathematical Model of Locality. Commun. ACM 15(3): 185-190 (1972) | |
| 18 | Edward G. Coffman Jr., L. A. Klimko, Barbara Ryan: Analysis of Scanning Policies for Reducing Disk Seek Times. SIAM J. Comput. 1(3): 269-279 (1972) | |
| 1971 | ||
| 17 | John L. Bruno, Edward G. Coffman Jr.: Nearly Optimal Binary Search Trees. IFIP Congress (1) 1971: 99-103 | |
| 16 | Edward G. Coffman Jr., T. A. Ryan: A Study of Storage Partitioning Using a Mathematical Model (Abstract). SOSP 1971: 122-129 | |
| 15 | Edward G. Coffman Jr., Neil D. Jones: Priority Paging Algorithms and the Extension Problem SWAT (FOCS) 1971: 177-181 | |
| 14 | Edward G. Coffman Jr., M. J. Elphick, Arie Shoshani: System Deadlocks. ACM Comput. Surv. 3(2): 67-78 (1971) | |
| 13 | Edward G. Coffman Jr., Brian Randell: Performance Predictions for Extended Paged Memories. Acta Inf. 1: 1-13 (1971) | |
| 1970 | ||
| 12 | Edward G. Coffman Jr., M. J. Elphick, Arie Shoshani: Deadlock Problems in Computer Systems. ARCS 1970: 311-325 | |
| 11 | Arie Shoshani, Edward G. Coffman Jr.: Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks SWAT (FOCS) 1970: 225-235 | |
| 10 | Edward G. Coffman Jr., Richard R. Muntz, H. Trotter: Waiting Time Distributions for Processor-Sharing Systems. J. ACM 17(1): 123-130 (1970) | |
| 9 | Richard R. Muntz, Edward G. Coffman Jr.: Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems. J. ACM 17(2): 324-338 (1970) | |
| 1969 | ||
| 8 | A. C. McKellar, Edward G. Coffman Jr.: Organizing Matrices and Matrix Operations for Paged Memory Systems. Commun. ACM 12(3): 153-165 (1969) | |
| 7 | Edward G. Coffman Jr.: Erratum: ``Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System''. J. ACM 16(1): 646 (1969) | |
| 6 | Edward G. Coffman Jr.: Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System. J. ACM 16(1): 73-90 (1969) | |
| 1968 | ||
| 5 | Edward G. Coffman Jr., Leonard Kleinrock: Computer scheduling methods and their countermeasures. AFIPS Spring Joint Computing Conference 1968: 11-21 | |
| 4 | Edward G. Coffman Jr., L. C. Varian: Further experimental data on the behavior of programs in a paging environment. Commun. ACM 11(7): 471-474 (1968) | |
| 3 | Edward G. Coffman Jr.: Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping. J. ACM 15(3): 341-353 (1968) | |
| 2 | Edward G. Coffman Jr., Leonard Kleinrock: Feedback Queueing Models for Time-Shared Systems. J. ACM 15(4): 549-576 (1968) | |
| 1967 | ||
| 1 | Leonard Kleinrock, Edward G. Coffman Jr.: Distribution of Attained Service in Time-Shared Systems. J. Comput. Syst. Sci. 1(3): 287-298 (1967) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page