Edward G. Coffman Jr.

Publication Activity (10 Years)

Years Active: 1964-2015
Publications (10 Years): 0

Top Venues

SIGMETRICS Perform. Evaluation Rev.

Acta Informatica

J. Sched.

Publications

Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky
How small are shifts required in optimal preemptive schedules? J. Sched. 18 (2) (2015)
Edward G. Coffman Jr., Petar Momcilovic
A particle process underlying SSD storage structures. SIGMETRICS Perform. Evaluation Rev. 41 (3) (2013)
Edward G. Coffman Jr.
Synthesis of local-rule processes: successes and challenges (abstract only). SIGMETRICS Perform. Evaluation Rev. 39 (4) (2012)
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) (2012)
Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak
An efficient algorithm for finding ideal schedules. Acta Informatica 49 (1) (2012)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak
CAUCHY localization: a distributed computation of WSNs. SIGMETRICS Perform. Evaluation Rev. 39 (2) (2011)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, William Moran
Minimalist counting in sensor networks (Noise helps). Ad Hoc Networks 9 (6) (2011)
Edward G. Coffman Jr., Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman
Channel fragmentation in dynamic spectrum access systems: a theoretical study. SIGMETRICS (2010)
Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky
Strategy vs risk in margining portfolios of options. 4OR 8 (4) (2010)
Edward G. Coffman Jr., Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman
Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study CoRR (2010)
Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky
A Computational Study of Margining Portfolios of Options by Two Approaches. ICISTM (2010)
Edward G. Coffman Jr., János Csirik, Lajos Rónyai, Ambrus Zsbán
Random-order bin packing. Discret. Appl. Math. 156 (14) (2008)
Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.
Self-Organizing Sleep-Wake Sensor Systems. SASO (2008)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, William Moran
Stochastic Counting in Sensor Networks, or: Noise Is Good. DCOSS (2008)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak
High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata. IPSN (2008)
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)
Edward G. Coffman Jr., Andreas Constantinides
Design of Local-Rule Protocols for Large-Scale File-Sharing Networks. SASO Workshops (2008)
Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.
Self-assembling sweep-and-sleep sensor systems. SIGMETRICS Perform. Evaluation Rev. 36 (2) (2008)
Kyung Joon Kwak, Edward G. Coffman Jr.
Retransmission in OBS networks with fiber delay lines. BROADNETS (2007)
Edward G. Coffman Jr., János Csirik
A Classification Scheme for Bin Packing Theory. Acta Cybern. 18 (1) (2007)
Andreas Constantinides, Edward G. Coffman Jr.
Optimal seamless self-assembly of files in linear networks. Optim. Lett. 1 (2) (2007)
Edward G. Coffman Jr., George S. Lueker
Approximation Algorithms for Extensible Bin Packing. J. Sched. 9 (1) (2006)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boonsit Yimwadsana
On Times to Compute Shapes in 2D Tile Self-assembly. DNA (2006)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Jing Feng, Vishal Misra
Free-Drop TCP. SIGMETRICS Perform. Evaluation Rev. 34 (3) (2006)
Peggy B. McGee, Steven M. Nowick, Edward G. Coffman Jr.
Efficient performance analysis of asynchronous systems based on periodicity. CODES+ISSS (2005)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Nadrian C. Seeman, Teddy Yimwadsana
Self-correcting Self-assembly: Growth Models and the Hammersley Process. DNA (2005)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic
DNA-Based Computation Times. DNA (2004)
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) (2004)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic
Self assembly times in DNA-based computation. SIGMETRICS Perform. Evaluation Rev. 32 (2) (2004)
Edward G. Coffman Jr., Andreas Constantinides, Dan Rubenstein, F. Bruce Shepherd, Angelos Stavrou
Content distribution for seamless transmission. SIGMETRICS Perform. Evaluation Rev. 32 (2) (2004)
Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky
Ideal preemptive schedules on two processors. Acta Informatica 39 (8) (2003)
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) (2003)
Edward G. Coffman Jr.
JACM 1976-1979. J. ACM 50 (1) (2003)
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) (2002)
Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler
Packing rectangles in a strip. Acta Informatica 38 (10) (2002)
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) (2002)
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) (2002)
Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic
The Dyadic Stream Merging Algorithm. J. Algorithms 43 (1) (2002)
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic
Kelly's LAN model revisited. SIGMETRICS Perform. Evaluation Rev. 29 (3) (2001)
Edward G. Coffman Jr., Predrag R. Jelenkovic
Threshold policies for single-resource reservation systems. SIGMETRICS Perform. Evaluation Rev. 28 (4) (2001)
Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.
Controlling the robots of Web search engines. SIGMETRICS/Performance (2001)
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) (2001)
Edward G. Coffman Jr., George S. Lueker
Approximation algorithms for extensible bin packing. SODA (2001)
Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.
Optimizing the Number of Robots for Web Search Engines. Telecommun. Syst. 17 (1-2) (2001)
Edward G. Coffman Jr., Alexander L. Stolyar
Bandwidth Packing. Algorithmica 29 (1) (2001)
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) (2000)
Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler
Average-Case Analysis of Retangle Packings. LATIN (2000)
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) (1999)
Edward G. Coffman Jr., Alexander L. Stolyar
Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. SODA (1999)
Edward G. Coffman Jr., Philippe Robert, Alexander L. Stolyar
The interval packing process of linear networks. SIGMETRICS Perform. Evaluation Rev. 27 (3) (1999)
Edward G. Coffman Jr., Predrag R. Jelenkovic
Performance of the move-to-front algorithm with Markov-modulated request sequences. Oper. Res. Lett. 25 (3) (1999)
Edward G. Coffman Jr., Leopold Flatto, Predrag R. Jelenkovic, Bjorn Poonen
Packing Random Intervals On-Line. Algorithmica 22 (4) (1998)
Edward G. Coffman Jr., Shimon Even
A Note on Limited Preemption. Parallel Process. Lett. 8 (1) (1998)
Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman
Polling Systems in Heavy Traffic: A Bessel Process Limit. Math. Oper. Res. 23 (2) (1998)
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) (1998)
John L. Bruno, Edward G. Coffman Jr.
Optimal Fault-Tolerant Computing on Multiprocessor Systems. Acta Informatica 34 (12) (1997)
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) (1997)
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) (1997)
Brenda S. Baker, Edward G. Coffman Jr.
Mutual Exclusion Scheduling. Theor. Comput. Sci. 162 (2) (1996)
Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman, Paul E. Wright
Processor-Shared Buffers with Reneging. Perform. Evaluation 19 (1) (1994)
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) (1994)
Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright
Optimal Stochastic Allocation of Machines Under Waiting-Time Constraints. SIAM J. Comput. 22 (2) (1993)
Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright
Stochastic Machine Minimization with Constant Service Times. Math. Oper. Res. 18 (2) (1993)
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) (1993)
Edward G. Coffman Jr., M. R. Garey
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. J. ACM 40 (5) (1993)
Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright
A Stochastic Checkpoint Optimization Problem. SIAM J. Comput. 22 (3) (1993)
Edward G. Coffman Jr., Peter W. Shor
Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. Algorithmica 9 (3) (1993)
Edward G. Coffman Jr., Leopold Flatto, Alexander Y. Kreinin
Scheduling Saves in Fault-Tolerant Computations. Acta Informatica 30 (5) (1993)
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)
Edward G. Coffman Jr., Edgar N. Gilbert
Paths through a maze of rectangles. Networks 22 (4) (1992)
Edward G. Coffman Jr., Zhen Liu
On the Optimal Stochastic Scheduling of Out-Forests. Oper. Res. 40 (Supplement-1) (1992)
Leonid B. Boguslavsky, Edward G. Coffman Jr., Edgar N. Gilbert, Alexander Y. Kreinin
Scheduling Checks and Saves. INFORMS J. Comput. 4 (1) (1992)
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) (1992)
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) (1991)
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)
Edward G. Coffman Jr., M. R. Garey
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling STOC (1991)
Edward G. Coffman Jr., Peter W. Shor
) Upright Matching Bound. SIAM J. Discret. Math. 4 (1) (1991)
Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton
First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. SODA (1990)
Edward G. Coffman Jr., Ardavan Nozari, Mihalis Yannakakis
Optimal Scheduling of Products with Two Subassemblies on a Single Machine. Oper. Res. 37 (3) (1989)
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) (1989)
Edward G. Coffman Jr., Frank Thomson Leighton
A Provably Efficient Algorithm for Dynamic Storage Allocation. J. Comput. Syst. Sci. 38 (1) (1989)
Edward G. Coffman Jr., J. C. Lagarias
Algorithms for Packing Squares: A Probabilistic Analysis. SIAM J. Comput. 18 (1) (1989)
A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto
Optimal directory placement on disk storage devices. J. ACM 35 (2) (1988)
Edward G. Coffman Jr., M. R. Garey, David S. Johnson
Bin packing with divisible item sizes. J. Complex. 3 (4) (1987)
Edward G. Coffman Jr., Guy Fayolle, Isi Mitrani
Two Queues with Alternating Service Periods. Performance (1987)
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) (1987)
Edward G. Coffman Jr., Edgar N. Gilbert
Polling and Greedy Servers on a Line. Queueing Syst. Theory Appl. 2 (2) (1987)
Edward G. Coffman Jr., Micha Hofri
Queueing Models of Secondary Storage Devices. Queueing Syst. Theory Appl. 1 (2) (1986)
Edward G. Coffman Jr., Frank Thomson Leighton
A Provably Efficient Algorithm for Dynamic Storage Allocation STOC (1986)
Edward G. Coffman Jr., Edgar N. Gilbert
A continuous polling system with constant service times. IEEE Trans. Inf. Theory 32 (4) (1986)
Edward G. Coffman Jr., Erol Gelenbe, Edgar N. Gilbert
Analysis of a Conveyor Queue in a Flexible Manufacturing System. SIGMETRICS (1986)
Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard
Algorithms for Resolving Conflicts in Dynamic Storage Allocation J. ACM 32 (2) (1985)
Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
Scheduling File Transfers. SIAM J. Comput. 14 (3) (1985)
Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp
A Stochastic Model of Fragmentation in Dynamic Storage Allocation. SIAM J. Comput. 14 (2) (1985)
Edward G. Coffman Jr., Edgar N. Gilbert
On the Expected Relative Performance of List Scheduling. Oper. Res. 33 (3) (1985)
A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto
Sequencing Problems in Two-Server Systems. Math. Oper. Res. 10 (4) (1985)
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) (1985)
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) (1984)
Edward G. Coffman Jr., Leopold Flatto, George S. Lueker
Expected Makespans for Largest-First Multiprocessor Scheduling. Performance (1984)
Edward G. Coffman Jr., Michael A. Langston
A Performance Guarantee for the Greedy Set-Partitioning Algorithm. Acta Informatica 21 (1984)

Edward G. Coffman Jr..css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Edward G. Coffman Jr.