default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward G. Coffman Jr.
Ed Coffman
Person information
- affiliation: Columbia University, New York City, USA
- award: ACM Distinguished Service Award, 2004
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2016
[j129]Bo Chen
, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak:
Normal-form preemption sequences for an open problem in scheduling theory. J. Sched. 19(6): 701-728 (2016)- 2015
- [j128]Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky:
How small are shifts required in optimal preemptive schedules? J. Sched. 18(2): 155-163 (2015) - [i2]Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak:
Structural Properties of an Open Problem in Preemptive Scheduling. CoRR abs/1502.04600 (2015) - 2014
- [j127]Ed Coffman, Robert Margolies, Peter Winkler, Gil Zussman:
Performance evaluation of fragmented structures: A theoretical study. Perform. Evaluation 79: 273-286 (2014) - 2013
- [j126]Edward G. Coffman Jr., Petar Momcilovic:
A particle process underlying SSD storage structures. SIGMETRICS Perform. Evaluation Rev. 41(3): 58-60 (2013) - 2012
- [j125]Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak:
An efficient algorithm for finding ideal schedules. Acta Informatica 49(1): 1-14 (2012) - [j124]Ed Coffman, Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman:
A performance analysis of channel fragmentation in dynamic spectrum access systems. Queueing Syst. Theory Appl. 71(3): 293-320 (2012) - [j123]Edward G. Coffman Jr.:
Synthesis of local-rule processes: successes and challenges (abstract only). SIGMETRICS Perform. Evaluation Rev. 39(4): 24 (2012) - [j122]Edward G. Coffman Jr., Yakov A. Kogan, Wai Sum Lai, V. Ramaswami:
Uptime and downtime analysis for hierarchical redundant systems in telecommunications. SIGMETRICS Perform. Evaluation Rev. 40(3): 59-61 (2012) - 2011
- [j121]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, William Moran:
Minimalist counting in sensor networks (Noise helps). Ad Hoc Networks 9(6): 987-997 (2011) - [j120]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak:
CAUCHY localization: a distributed computation of WSNs. SIGMETRICS Perform. Evaluation Rev. 39(2): 59-61 (2011) - [c52]Ed Coffman:
Computer Storage Fragmentation: Pioneering Work of Brian Randell. Dependable and Historic Computing 2011: 174-184 - 2010
- [j119]Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky:
Strategy vs risk in margining portfolios of options. 4OR 8(4): 375-386 (2010) - [c51]Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky:
A Computational Study of Margining Portfolios of Options by Two Approaches. ICISTM 2010: 325-332 - [c50]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 - [i1]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)
2000 – 2009
- 2008
- [j118]Edward G. Coffman Jr., János Csirik, Lajos Rónyai, Ambrus Zsbán:
Random-order bin packing. Discret. Appl. Math. 156(14): 2810-2816 (2008) - [j117]Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.:
Self-assembling sweep-and-sleep sensor systems. SIGMETRICS Perform. Evaluation Rev. 36(2): 131-133 (2008) - [c49]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, William Moran:
Stochastic Counting in Sensor Networks, or: Noise Is Good. DCOSS 2008: 32-45 - [c48]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 - [c47]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 - [c46]Edward G. Coffman Jr., Andreas Constantinides:
Design of Local-Rule Protocols for Large-Scale File-Sharing Networks. SASO Workshops 2008: 278-283 - [c45]Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.:
Self-Organizing Sleep-Wake Sensor Systems. SASO 2008: 393-402 - 2007
- [j116]Edward G. Coffman Jr., János Csirik:
A Classification Scheme for Bin Packing Theory. Acta Cybern. 18(1): 47-60 (2007) - [j115]Andreas Constantinides, Edward G. Coffman Jr.:
Optimal seamless self-assembly of files in linear networks. Optim. Lett. 1(2): 119-128 (2007) - [c44]Kyung Joon Kwak, Edward G. Coffman Jr.:
Retransmission in OBS networks with fiber delay lines. BROADNETS 2007: 243-249 - [r3]Edward G. Coffman Jr., János Csirik:
Performance Guarantees for One-Dimensional Bin Packing. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r2]Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik:
Variants of Classical One-Dimensional Bin Packing. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik:
Variable-Sized Bin Packing and Bin Covering. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j114]Edward G. Coffman Jr., George S. Lueker:
Approximation Algorithms for Extensible Bin Packing. J. Sched. 9(1): 63-69 (2006) - [j113]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Jing Feng, Vishal Misra:
Free-Drop TCP. SIGMETRICS Perform. Evaluation Rev. 34(3): 33-35 (2006) - [c43]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boonsit Yimwadsana:
On Times to Compute Shapes in 2D Tile Self-assembly. DNA 2006: 215-222 - 2005
- [c42]Peggy B. McGee, Steven M. Nowick, Edward G. Coffman Jr.:
Efficient performance analysis of asynchronous systems based on periodicity. CODES+ISSS 2005: 225-230 - [c41]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
- [j112]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) - [j111]Edward G. Coffman Jr., Andreas Constantinides, Dan Rubenstein, F. Bruce Shepherd, Angelos Stavrou:
Content distribution for seamless transmission. SIGMETRICS Perform. Evaluation Rev. 32(2): 31-32 (2004) - [j110]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic:
Self assembly times in DNA-based computation. SIGMETRICS Perform. Evaluation Rev. 32(2): 35-37 (2004) - [c40]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic:
DNA-Based Computation Times. DNA 2004: 14-23 - [e2]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, ISBN 1-58113-873-3 [contents] - 2003
- [j109]Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky:
Ideal preemptive schedules on two processors. Acta Informatica 39(8): 597-612 (2003) - [j108]Edward G. Coffman Jr.:
JACM 1976-1979. J. ACM 50(1): 16 (2003) - [j107]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 Perform. Evaluation Rev. 31(2): 14-16 (2003) - 2002
- [j106]Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler:
Packing rectangles in a strip. Acta Informatica 38(10): 673-693 (2002) - [j105]Eyjólfur Ingi Ásgeirsson, Urtzi Ayesta, Edward G. Coffman Jr., J. Etra, Petar Momcilovic, David J. Phillips, V. Vokhshoori, Z. Wang, J. Wolfe:
Closed On-Line Bin Packing. Acta Cybern. 15(3): 361-367 (2002) - [j104]Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic:
The Dyadic Stream Merging Algorithm. J. Algorithms 43(1): 120-137 (2002) - [j103]Edward G. Coffman Jr., Costas Courcoubetis, Michael R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis:
Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing. SIAM Rev. 44(1): 95-108 (2002) - [j102]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein:
Flood search under the California split strategy. SIGMETRICS Perform. Evaluation Rev. 30(3): 15-16 (2002) - 2001
- [j101]Edward G. Coffman Jr., Alexander L. Stolyar:
Bandwidth Packing. Algorithmica 29(1): 70-88 (2001) - [j100]Sem C. Borst, Edward G. Coffman Jr., Edgar N. Gilbert, Philip A. Whiting, Peter M. Winkler:
Optimal Carrier Sharing in Wireless TDMA. J. Interconnect. Networks 2(2): 189-211 (2001) - [j99]Edward G. Coffman Jr., Predrag R. Jelenkovic:
Threshold policies for single-resource reservation systems. SIGMETRICS Perform. Evaluation Rev. 28(4): 9-10 (2001) - [j98]Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic:
Kelly's LAN model revisited. SIGMETRICS Perform. Evaluation Rev. 29(3): 28-29 (2001) - [j97]Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.:
Optimizing the Number of Robots for Web Search Engines. Telecommun. Syst. 17(1-2): 243-264 (2001) - [c39]Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.:
Controlling the robots of Web search engines. SIGMETRICS/Performance 2001: 236-244 - [c38]Edward G. Coffman Jr., George S. Lueker:
Approximation algorithms for extensible bin packing. SODA 2001: 586-588 - 2000
- [j96]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. Discret. Math. 13(3): 384-402 (2000) - [c37]Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler:
Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297
1990 – 1999
- 1999
- [j95]John L. Bruno, Edward G. Coffman Jr., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor:
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. Math. Oper. Res. 24(2): 362-382 (1999) - [j94]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) - [j93]Edward G. Coffman Jr., Philippe Robert, Alexander L. Stolyar:
The interval packing process of linear networks. SIGMETRICS Perform. Evaluation Rev. 27(3): 3-4 (1999) - [c36]Edward G. Coffman Jr., Alexander L. Stolyar:
Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. SODA 1999: 877-878 - [p1]Edward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo:
Bin Packing Approximation Algorithms: Combinatorial Analysis. Handbook of Combinatorial Optimization 1999: 151-207 - 1998
- [j92]Edward G. Coffman Jr., Leopold Flatto, Predrag R. Jelenkovic, Bjorn Poonen:
Packing Random Intervals On-Line. Algorithmica 22(4): 448-476 (1998) - [j91]Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman:
Polling Systems in Heavy Traffic: A Bessel Process Limit. Math. Oper. Res. 23(2): 257-304 (1998) - [j90]Edward G. Coffman Jr., Shimon Even:
A Note on Limited Preemption. Parallel Process. Lett. 8(1): 3-6 (1998) - [j89]Edward G. Coffman Jr., Nabil Kahalé, Frank Thomson Leighton:
Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. SIAM J. Comput. 27(5): 1221-1236 (1998) - 1997
- [j88]John L. Bruno, Edward G. Coffman Jr.:
Optimal Fault-Tolerant Computing on Multiprocessor Systems. Acta Informatica 34(12): 881-904 (1997) - [j87]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) - [j86]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
- [j85]Brenda S. Baker, Edward G. Coffman Jr.:
Mutual Exclusion Scheduling. Theor. Comput. Sci. 162(2): 225-243 (1996) - 1994
- [j84]Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman, Paul E. Wright:
Processor-Shared Buffers with Reneging. Perform. Evaluation 19(1): 25-46 (1994) - [j83]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
- [j82]Edward G. Coffman Jr., Leopold Flatto, Alexander Y. Kreinin:
Scheduling Saves in Fault-Tolerant Computations. Acta Informatica 30(5): 409-423 (1993) - [j81]Edward G. Coffman Jr., Peter W. Shor:
Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. Algorithmica 9(3): 253-277 (1993) - [j80]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) - [j79]Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright:
Stochastic Machine Minimization with Constant Service Times. Math. Oper. Res. 18(2): 300-316 (1993) - [j78]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) - [j77]Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright:
A Stochastic Checkpoint Optimization Problem. SIAM J. Comput. 22(3): 650-659 (1993) - [j76]Edward G. Coffman Jr., Shlomo Halfin, Alain Jean-Marie, Philippe Robert:
Stochastic analysis of a slotted FIFO communication channel. IEEE Trans. Inf. Theory 39(5): 1555-1566 (1993) - [c35]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 - 1992
- [j75]Leonid B. Boguslavsky, Edward G. Coffman Jr., Edgar N. Gilbert, Alexander Y. Kreinin:
Scheduling Checks and Saves. INFORMS J. Comput. 4(1): 60-69 (1992) - [j74]Julien Bramel, Edward G. Coffman Jr., Peter W. Shor, David Simchi-Levi:
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Oper. Res. 40(6): 1095-1106 (1992) - [j73]Edward G. Coffman Jr., Zhen Liu:
On the Optimal Stochastic Scheduling of Out-Forests. Oper. Res. 40(Supplement-1): S67-S75 (1992) - [j72]Edward G. Coffman Jr., Edgar N. Gilbert:
Paths through a maze of rectangles. Networks 22(4): 349-367 (1992) - 1991
- [b2]Edward G. Coffman Jr., George S. Lueker:
Probabilistic analysis of packing and partitioning algorithms. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1991, ISBN 978-0-471-53272-9, pp. I-XIV, 1-192 - [j71]Edward G. Coffman Jr., Peter W. Shor:
A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound. SIAM J. Discret. Math. 4(1): 48-57 (1991) - [j70]Edward G. Coffman Jr., B. M. Igelnik, Yakov A. Kogan:
Controlled stochastic model of a communication system with multiple sources. IEEE Trans. Inf. Theory 37(5): 1379-1387 (1991) - [c34]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 - [c33]Edward G. Coffman Jr., M. R. Garey:
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. STOC 1991: 241-248 - 1990
- [c32]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
1980 – 1989
- 1989
- [j69]Edward G. Coffman Jr., Ardavan Nozari, Mihalis Yannakakis:
Optimal Scheduling of Products with Two Subassemblies on a Single Machine. Oper. Res. 37(3): 426-436 (1989) - [j68]Edward G. Coffman Jr., Frank Thomson Leighton:
A Provably Efficient Algorithm for Dynamic Storage Allocation. J. Comput. Syst. Sci. 38(1): 2-35 (1989) - [j67]Edward G. Coffman Jr., J. C. Lagarias:
Algorithms for Packing Squares: A Probabilistic Analysis. SIAM J. Comput. 18(1): 166-185 (1989) - [j66]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) - 1988
- [j65]A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto:
Optimal directory placement on disk storage devices. J. ACM 35(2): 433-446 (1988) - 1987
- [j64]Edward G. Coffman Jr., M. R. Garey, David S. Johnson:
Bin packing with divisible item sizes. J. Complex. 3(4): 406-428 (1987) - [j63]Edward G. Coffman Jr., Edgar N. Gilbert:
Polling and Greedy Servers on a Line. Queueing Syst. Theory Appl. 2(2): 115-145 (1987) - [j62]Fan R. K. Chung, Edward G. Coffman Jr., Martin I. Reiman, Burton Simon:
The forwarding index of communication networks. IEEE Trans. Inf. Theory 33(2): 224-232 (1987) - [c31]Edward G. Coffman Jr., Guy Fayolle, Isi Mitrani:
Two Queues with Alternating Service Periods. Performance 1987: 227-239 - 1986
- [j61]Edward G. Coffman Jr., Micha Hofri:
Queueing Models of Secondary Storage Devices. Queueing Syst. Theory Appl. 1(2): 129-168 (1986) - [j60]Edward G. Coffman Jr., Edgar N. Gilbert:
A continuous polling system with constant service times. IEEE Trans. Inf. Theory 32(4): 584-591 (1986) - [c30]Edward G. Coffman Jr., Erol Gelenbe, Edgar N. Gilbert:
Analysis of a Conveyor Queue in a Flexible Manufacturing System. SIGMETRICS 1986: 204-223 - [c29]Edward G. Coffman Jr., Frank Thomson Leighton:
A Provably Efficient Algorithm for Dynamic Storage Allocation. STOC 1986: 77-90 - 1985
- [j59]Edward G. Coffman Jr., Edgar N. Gilbert:
On the Expected Relative Performance of List Scheduling. Oper. Res. 33(3): 548-561 (1985) - [j58]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) - [j57]A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto:
Sequencing Problems in Two-Server Systems. Math. Oper. Res. 10(4): 585-598 (1985) - [j56]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) - [j55]Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh:
Scheduling File Transfers. SIAM J. Comput. 14(3): 744-780 (1985) - [j54]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) - 1984
- [j53]Edward G. Coffman Jr., Michael A. Langston:
A Performance Guarantee for the Greedy Set-Partitioning Algorithm. Acta Informatica 21: 409-415 (1984) - [j52]Edward G. Coffman Jr., Edgar N. Gilbert:
Dynamic, First-Fit Packings in Two or More Dimensions. Inf. Control. 61(1): 1-14 (1984) - [j51]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) - [j50]Edward G. Coffman Jr., Greg N. Frederickson, George S. Lueker:
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors. Math. Oper. Res. 9(2): 260-266 (1984) - [j49]Edward G. Coffman Jr., Mihalis Yannakakis:
Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum. Math. Oper. Res. 9(3): 384-390 (1984) - [j48]Brenda S. Baker, Edward G. Coffman Jr.:
Insertion and Compaction Algorithms in Sequentially Allocated Storage. SIAM J. Comput. 13(3): 600-609 (1984) - [j47]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) - [c28]Edward G. Coffman Jr., Leopold Flatto, George S. Lueker:
Expected Makespans for Largest-First Multiprocessor Scheduling. Performance 1984: 491-506 - [c27]Edward G. Coffman Jr.:
Recent Progress in the Performance Evaluation of Fundamental Allocation Algorithms. SIGMETRICS 1984: 2-6 - 1983
- [j46]Edward G. Coffman Jr., Ravi Sethi:
Instruction Sets for Evaluating Arithmetic Expressions. J. ACM 30(3): 457-478 (1983) - [j45]Edward G. Coffman Jr., M. R. Garey, David S. Johnson:
Dynamic Bin Packing. SIAM J. Comput. 12(2): 227-258 (1983) - [c26]Edward G. Coffman Jr., Martin I. Reiman:
Diffusion Approximations for Computer/Communications Systems. Computer Performance and Reliability 1983: 33-54 - [c25]Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh:
Scheduling File Transfers in a Distributed Network. PODC 1983: 254-266 - [c24]Edward G. Coffman Jr., Martin I. Reiman:
Diffusion approximations for storage processes in computer systems. SIGMETRICS 1983: 93-117 - 1982
- [j44]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) - [j43]Edward G. Coffman Jr., Micha Hofri:
On the Expected Performance of Scanning Disks. SIAM J. Comput. 11(1): 60-70 (1982) - [c23]François Baccelli, Edward G. Coffman Jr.:
A Data Base Replication Analysis Using an M/M/m Queue with Service Interruptions. SIGMETRICS 1982: 102-107 - 1981
- [j42]Edward G. Coffman Jr., Henry O. Pollak, Erol Gelenbe, Roger C. Wood:
An analysis of parallel-read sequential-write systems. Perform. Evaluation 1(1): 62-69 (1981) - [j41]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) - 1980
- [j40]Edward G. Coffman Jr., Kimming So, Micha Hofri, Andrew Chi-Chih Yao:
A Stochastic Model of Bin-Packing. Inf. Control. 44(2): 105-115 (1980) - [j39]Edward G. Coffman Jr., Isi Mitrani:
A Characterization of Waiting Time Performance Realizable by Single-Server Queues. Oper. Res. 28(3-Part-II): 810-821 (1980) - [j38]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) - [j37]Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest:
Orthogonal Packings in Two Dimensions. SIAM J. Comput. 9(4): 846-855 (1980) - [c22]Edward G. Coffman Jr., Kimming So:
On the Comparison Between Single and Multiple Processor Systems. ISCA 1980: 72-79 - [c21]Edward G. Coffman Jr., Erol Gelenbe, Roger C. Wood:
Optimal replication of parallel-read, sequential-write systems. Performance 1980: 209-216 - [c20]Edward G. Coffman Jr., Erol Gelenbe, Brigitte Plateau:
Optimization of the number of copies in a distribution data base. Performance 1980: 257-263
1970 – 1979
- 1979
- [j36]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
- [j35]Edward G. Coffman Jr., Joseph Y.-T. Leung, D. W. Ting:
Bin Packing: Maximizing the Number of Pieces Packed. Acta Informatica 9: 263-271 (1978) - [j34]Edward G. Coffman Jr., Micha Hofri:
A Class of FIFO Queues Arising in Computer Systems. Oper. Res. 26(5): 864-880 (1978) - [j33]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
- [c19]Edward G. Coffman Jr., Joseph Y.-T. Leung:
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. FOCS 1977: 214-221 - [c18]Edward G. Coffman Jr., Micha Hofri:
On Scanning-Disks and the Analysis of their Steady State Behavior. Performance 1977: 251-263 - 1976
- [j32]Edward G. Coffman Jr., Ravi Sethi:
Algorithms Minimizing Mean Flow Time: Schedule-Length Properties. Acta Informatica 6: 1-14 (1976) - [j31]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) - [j30]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) - [j29]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) - [c17]Edward G. Coffman Jr., Ravi Sethi:
A generalized bound on LPT sequencing. SIGMETRICS 1976: 306-310 - 1975
- [j28]G. J. Burnett, Edward G. Coffman Jr.:
Analysis of Interleaved Memory Systems Using Blockage Buffers. Commun. ACM 18(2): 91-95 (1975) - [c16]Edward G. Coffman Jr., Isi Mitrani:
Selecting a Scheduling Rule that Meets Pre-Specified Response Time Demands. SOSP 1975: 187-191 - 1974
- [j27]John L. Bruno, Edward G. Coffman Jr., Ravi Sethi:
Scheduling Independent Tasks to Reduce Mean Finishing Time. Commun. ACM 17(7): 382-387 (1974) - [j26]J. A. Michel, Edward G. Coffman Jr.:
Synthesis of a Feedback Queueing Discipline for Computer Operation. J. ACM 21(2): 329-339 (1974) - [j25]Thomas A. Ryan Jr., Edward G. Coffman Jr.:
A Problem in Multiprogrammed Storage Allocation. IEEE Trans. Computers 23(11): 1116-1122 (1974) - [c15]John L. Bruno, Edward G. Coffman Jr., Ravi Sethi:
Algorithms for Minimizing Mean Flow Time. IFIP Congress 1974: 504-510 - 1973
- [b1]Edward G. Coffman Jr., Peter J. Denning:
Operating Systems Theory. Prentice-Hall 1973 - [j24]Edward G. Coffman Jr.:
A Note on the Relative Performance of Two Disk Scanning Policies. Inf. Process. Lett. 2(1): 15-17 (1973) - [j23]G. J. Burnett, Edward G. Coffman Jr.:
A Combinatorial Problem Related to Interleaved Memory Systems. J. ACM 20(1): 39-45 (1973) - [c14]Edward G. Coffman Jr.:
A Survey of Mathematical Results in Flow-Time Scheduling for Computer Systems. GI Jahrestagung 1973: 25-46 - [c13]John L. Bruno, Edward G. Coffman Jr., Ravi Sethi:
Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract). SOSP 1973: 102-103 - 1972
- [j22]Edward G. Coffman Jr., Ronald L. Graham:
Optimal Scheduling for Two-Processor Systems. Acta Informatica 1: 200-213 (1972) - [j21]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) - [j20]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) - [c12]John L. Bruno, Edward G. Coffman Jr., W. H. Hosken:
Consistency of Synchronization Nets using P and V Operations. SWAT 1972: 71-77 - 1971
- [j19]Edward G. Coffman Jr., Brian Randell:
Performance Predictions for Extended Paged Memories. Acta Informatica 1: 1-13 (1971) - [j18]Edward G. Coffman Jr., M. J. Elphick, Arie Shoshani:
System Deadlocks. ACM Comput. Surv. 3(2): 67-78 (1971) - [j17]Edward G. Coffman Jr., Gerald Jay Burnett, Robert Archer Snowdon:
On the Performance of Interleaved Memories with Multiple-Word Bandwidths. IEEE Trans. Computers 20(12): 1570-1573 (1971) - [c11]Edward G. Coffman Jr., Neil D. Jones:
Priority Paging Algorithms and the Extension Problem. SWAT 1971: 177-181 - [c10]John L. Bruno, Edward G. Coffman Jr.:
Nearly Optimal Binary Search Trees. IFIP Congress (1) 1971: 99-103 - [c9]Edward G. Coffman Jr., T. A. Ryan:
A Study of Storage Partitioning Using a Mathematical Model (Abstract). SOSP 1971: 122-129 - 1970
- [j16]Edward G. Coffman Jr., J. Eve:
File structures using hashing functions. Commun. ACM 13(7): 427-432 (1970) - [j15]Edward G. Coffman Jr., Richard R. Muntz, Hale F. Trotter:
Waiting Time Distributions for Processor-Sharing Systems. J. ACM 17(1): 123-130 (1970) - [j14]Richard R. Muntz, Edward G. Coffman Jr.:
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems. J. ACM 17(2): 324-338 (1970) - [c8]G. J. Burnett, Edward G. Coffman Jr.:
A study of interleaved memory systems. AFIPS Spring Joint Computing Conference 1970: 467-474 - [c7]Edward G. Coffman Jr., M. J. Elphick, Arie Shoshani:
Deadlock Problems in Computer Systems. ARCS 1970: 311-325 - [c6]Arie Shoshani, Edward G. Coffman Jr.:
Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks. SWAT 1970: 225-235
1960 – 1969
- 1969
- [j13]A. C. McKellar, Edward G. Coffman Jr.:
Organizing Matrices and Matrix Operations for Paged Memory Systems. Commun. ACM 12(3): 153-165 (1969) - [j12]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) - [j11]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) - [j10]Edward G. Coffman Jr.:
On the Tradeoff Between Response and Preemption Costs in a Foreground-Background Computer Service Discipline. IEEE Trans. Computers 18(10): 942-947 (1969) - [j9]Richard R. Muntz, Edward G. Coffman Jr.:
Optimal Preemptive Scheduling on Two-Processor Systems. IEEE Trans. Computers 18(11): 1014-1020 (1969) - [c5]Edward G. Coffman Jr., Richard R. Muntz:
Models of Pure time-sharing disciplines for resource allocation. ACM National Conference 1969: 217-228 - [e1]Peter J. Denning, Edward G. Coffman Jr.:
Proceedings of the Second Symposium on Operating Systems Principles, SOSP 1969, Princeton, NJ, USA, October 20-22, 1969. ACM 1969 [contents] - 1968
- [j8]Edward G. Coffman Jr., Lee C. Varian:
Further experimental data on the behavior of programs in a paging environment. Commun. ACM 11(7): 471-474 (1968) - [j7]Edward G. Coffman Jr.:
Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping. J. ACM 15(3): 341-353 (1968) - [j6]Edward G. Coffman Jr., Leonard Kleinrock:
Feedback Queueing Models for Time-Shared Systems. J. ACM 15(4): 549-576 (1968) - [j5]Edward G. Coffman Jr.:
A Simple Probability Model Yielding Performance Bounds for Modular Memory Systems. IEEE Trans. Computers 17(1): 86-89 (1968) - [j4]Edward G. Coffman Jr., A. C. McKellar:
On the Motion of an Unbounded, Markov Queue in Random Access Storage. IEEE Trans. Computers 17(6): 600-603 (1968) - [j3]Edward G. Coffman Jr., Martin S. Schmookler:
A Random-Walk Model of a Queue Storage Problem. IEEE Trans. Computers 17(11): 1093-1095 (1968) - [c4]Edward G. Coffman Jr., Leonard Kleinrock:
Computer scheduling methods and their countermeasures. AFIPS Spring Joint Computing Conference 1968: 11-21 - 1967
- [j2]Leonard Kleinrock, Edward G. Coffman Jr.:
Distribution of Attained Service in Time-Shared Systems. J. Comput. Syst. Sci. 1(3): 287-298 (1967) - [c3]Edward G. Coffman Jr.:
An analysis of computer operations under running time priority disciplines. Symposium on Interactive Systems for Experimental Applied Mathematics 1967: 257-270 - [c2]Lee C. Varian, Edward G. Coffman Jr.:
An empirical study of the behavior of programs in a paging environment. SOSP 1967 - 1966
- [j1]Edward G. Coffman Jr., Roger C. Wood:
Interarrival statistics for time sharing systems. Commun. ACM 9(7): 500-503 (1966) - 1964
- [c1]Jules I. Schwartz, Edward G. Coffman Jr., Clark Weissman:
A general-purpose time-sharing system. AFIPS Spring Joint Computing Conference 1964: 397-411
Coauthor Index
M. R. Garey
aka: Michael R. Garey
aka: Michael R. Garey
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
