Edward G. Coffman Jr.

According to our database, Edward G. Coffman Jr. authored at least 184 papers between 1964 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2016

Normal-form preemption sequences for an open problem in scheduling theory.

Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak

J. Sched., 2016

2015

How small are shifts required in optimal preemptive schedules?

Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky

J. Sched., 2015

Structural Properties of an Open Problem in Preemptive Scheduling.

Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak

CoRR, 2015

2014

Performance evaluation of fragmented structures: A theoretical study.

Ed Coffman, Robert Margolies, Peter Winkler, Gil Zussman

Perform. Evaluation, 2014

2013

A particle process underlying SSD storage structures.

Edward G. Coffman Jr., Petar Momcilovic

SIGMETRICS Perform. Evaluation Rev., 2013

2012

Uptime and downtime analysis for hierarchical redundant systems in telecommunications.

Edward G. Coffman Jr., Yakov A. Kogan, Wai Sum Lai, V. Ramaswami

SIGMETRICS Perform. Evaluation Rev., 2012

Synthesis of local-rule processes: successes and challenges (abstract only).

Edward G. Coffman Jr.

SIGMETRICS Perform. Evaluation Rev., 2012

A performance analysis of channel fragmentation in dynamic spectrum access systems.

Ed Coffman, Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman

Queueing Syst. Theory Appl., 2012

An efficient algorithm for finding ideal schedules.

Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak

Acta Informatica, 2012

2011

CAUCHY localization: a distributed computation of WSNs.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak

SIGMETRICS Perform. Evaluation Rev., 2011

Minimalist counting in sensor networks (Noise helps).

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, William Moran

Ad Hoc Networks, 2011

Computer Storage Fragmentation: Pioneering Work of Brian Randell.

Ed Coffman

Proceedings of the Dependable and Historic Computing, 2011

2010

Strategy vs risk in margining portfolios of options.

Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky

4OR, 2010

Channel fragmentation in dynamic spectrum access systems: a theoretical study.

Edward G. Coffman Jr., Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman

Proceedings of the SIGMETRICS 2010, 2010

A Computational Study of Margining Portfolios of Options by Two Approaches.

Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky

Proceedings of the Information Systems, Technology and Management, 2010

2008

Self-assembling sweep-and-sleep sensor systems.

Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.

SIGMETRICS Perform. Evaluation Rev., 2008

Random-order bin packing.

Edward G. Coffman Jr., János Csirik, Lajos Rónyai, Ambrus Zsbán

Discret. Appl. Math., 2008

Self-Organizing Sleep-Wake Sensor Systems.

Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.

Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

Design of Local-Rule Protocols for Large-Scale File-Sharing Networks.

Edward G. Coffman Jr., Andreas Constantinides

Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

Cyclic Cellular Automata: A Tool for Self-Organizing Sleep Scheduling in Sensor Networks.

Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. Coffman Jr.

Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008

High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak

Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008

Stochastic Counting in Sensor Networks, or: Noise Is Good.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, William Moran

Proceedings of the Distributed Computing in Sensor Systems, 2008

2007

Variable-Sized Bin Packing and Bin Covering.

Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Variants of Classical One-Dimensional Bin Packing.

Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Performance Guarantees for One-Dimensional Bin Packing.

Edward G. Coffman Jr., János Csirik

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Optimal seamless self-assembly of files in linear networks.

Andreas Constantinides, Edward G. Coffman Jr.

Optim. Lett., 2007

A Classification Scheme for Bin Packing Theory.

Edward G. Coffman Jr., János Csirik

Acta Cybern., 2007

Retransmission in OBS networks with fiber delay lines.

Kyung Joon Kwak, Edward G. Coffman Jr.

Proceedings of the Fourth International Conference on Broadband Communications, 2007

2006

Free-Drop TCP.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Jing Feng, Vishal Misra

SIGMETRICS Perform. Evaluation Rev., 2006

Approximation Algorithms for Extensible Bin Packing.

Edward G. Coffman Jr., George S. Lueker

J. Sched., 2006

On Times to Compute Shapes in 2D Tile Self-assembly.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boonsit Yimwadsana

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005

Self-correcting Self-assembly: Growth Models and the Hammersley Process.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Nadrian C. Seeman, Teddy Yimwadsana

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

Efficient performance analysis of asynchronous systems based on periodicity.

Peggy B. McGee, Steven M. Nowick, Edward G. Coffman Jr.

Proceedings of the 3rd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, 2005

2004

Content distribution for seamless transmission.

Edward G. Coffman Jr., Andreas Constantinides, Dan Rubenstein, F. Bruce Shepherd, Angelos Stavrou

SIGMETRICS Perform. Evaluation Rev., 2004

Self assembly times in DNA-based computation.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic

SIGMETRICS Perform. Evaluation Rev., 2004

Flood search under the California Split rule.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein

Oper. Res. Lett., 2004

DNA-Based Computation Times.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar Momcilovic

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

2003

An asymptotically optimal greedy algorithm for large optical burst switching systems.

Lachlan L. H. Andrew, Yuliy M. Baryshnikov, Edward G. Coffman Jr., Stephen V. Hanly, Jolyon White

SIGMETRICS Perform. Evaluation Rev., 2003

JACM 1976-1979.

Edward G. Coffman Jr.

J. ACM, 2003

Ideal preemptive schedules on two processors.

Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky

Acta Informatica, 2003

2002

Flood search under the California split strategy.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein

SIGMETRICS Perform. Evaluation Rev., 2002

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing.

Edward G. Coffman Jr., Costas Courcoubetis, Michael R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis

SIAM Rev., 2002

The Dyadic Stream Merging Algorithm.

Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic

J. Algorithms, 2002

Closed On-Line Bin Packing.

Eyjólfur Ingi Ásgeirsson, Urtzi Ayesta, Edward G. Coffman Jr., J. Etra, Petar Momcilovic, David J. Phillips, V. Vokhshoori, Z. Wang, J. Wolfe

Acta Cybern., 2002

Packing rectangles in a strip.

Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler

Acta Informatica, 2002

2001

Optimizing the Number of Robots for Web Search Engines.

Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.

Telecommun. Syst., 2001

Threshold policies for single-resource reservation systems.

Edward G. Coffman Jr., Predrag R. Jelenkovic

SIGMETRICS Perform. Evaluation Rev., 2001

Kelly's LAN model revisited.

Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic

SIGMETRICS Perform. Evaluation Rev., 2001

Optimal Carrier Sharing in Wireless TDMA.

Sem C. Borst, Edward G. Coffman Jr., Edgar N. Gilbert, Philip A. Whiting, Peter M. Winkler

J. Interconnect. Networks, 2001

Bandwidth Packing.

Edward G. Coffman Jr., Alexander L. Stolyar

Algorithmica, 2001

Controlling the robots of Web search engines.

Jerome Talim, Zhen Liu, Philippe Nain, Edward G. Coffman Jr.

Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

2000

Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings.

Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis

SIAM J. Discret. Math., 2000

Average-Case Analysis of Retangle Packings.

Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

The interval packing process of linear networks.

Edward G. Coffman Jr., Philippe Robert, Alexander L. Stolyar

SIGMETRICS Perform. Evaluation Rev., 1999

Performance of the move-to-front algorithm with Markov-modulated request sequences.

Edward G. Coffman Jr., Predrag R. Jelenkovic

Oper. Res. Lett., 1999

Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems.

John L. Bruno, Edward G. Coffman Jr., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor

Math. Oper. Res., 1999

Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms.

Edward G. Coffman Jr., Alexander L. Stolyar

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Bin Packing Approximation Algorithms: Combinatorial Analysis.

Edward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo

Proceedings of the Handbook of Combinatorial Optimization, 1999

1998

Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times.

Edward G. Coffman Jr., Nabil Kahalé, Frank Thomson Leighton

SIAM J. Comput., 1998

A Note on Limited Preemption.

Edward G. Coffman Jr., Shimon Even

Parallel Process. Lett., 1998

Polling Systems in Heavy Traffic: A Bessel Process Limit.

Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman

Math. Oper. Res., 1998

Packing Random Intervals On-Line.

Edward G. Coffman Jr., Leopold Flatto, Predrag R. Jelenkovic, Bjorn Poonen

Algorithmica, 1998

1997

Bin packing with discrete item sizes, part II: Tight bounds on First Fit.

Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber

Random Struct. Algorithms, 1997

An Approximate Model of Processor Communication Rings Under Heavy Load.

Edward G. Coffman Jr., Leopold Flatto, Edgar N. Gilbert, Albert G. Greenberg

Inf. Process. Lett., 1997

Optimal Fault-Tolerant Computing on Multiprocessor Systems.

John L. Bruno, Edward G. Coffman Jr.

Acta Informatica, 1997

1996

Mutual Exclusion Scheduling.

Brenda S. Baker, Edward G. Coffman Jr.

Theor. Comput. Sci., 1996

1994

The Processor Minimization Problem with Independent Waiting-Time Constraints.

Edward G. Coffman Jr., Leopold Flatto, Bjorn Poonen, Paul E. Wright

Theor. Comput. Sci., 1994

Processor-Shared Buffers with Reneging.

Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman, Paul E. Wright

Perform. Evaluation, 1994

1993

Stochastic analysis of a slotted FIFO communication channel.

Edward G. Coffman Jr., Shlomo Halfin, Alain Jean-Marie, Philippe Robert

IEEE Trans. Inf. Theory, 1993

A Stochastic Checkpoint Optimization Problem.

Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright

SIAM J. Comput., 1993

Optimal Stochastic Allocation of Machines Under Waiting-Time Constraints.

Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright

SIAM J. Comput., 1993

Stochastic Machine Minimization with Constant Service Times.

Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright

Math. Oper. Res., 1993

Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling.

Edward G. Coffman Jr., M. R. Garey

J. ACM, 1993

Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms.

Edward G. Coffman Jr., Peter W. Shor

Algorithmica, 1993

Scheduling Saves in Fault-Tolerant Computations.

Edward G. Coffman Jr., Leopold Flatto, Alexander Y. Kreinin

Acta Informatica, 1993

Markov chains, computer proofs, and average-case analysis of best fit bin packing.

Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Paths through a maze of rectangles.

Edward G. Coffman Jr., Edgar N. Gilbert

Networks, 1992

On the Optimal Stochastic Scheduling of Out-Forests.

Edward G. Coffman Jr., Zhen Liu

Oper. Res., 1992

Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands.

Julien Bramel, Edward G. Coffman Jr., Peter W. Shor, David Simchi-Levi

Oper. Res., 1992

Scheduling Checks and Saves.

Leonid B. Boguslavsky, Edward G. Coffman Jr., Edgar N. Gilbert, Alexander Y. Kreinin

INFORMS J. Comput., 1992

1991

Controlled stochastic model of a communication system with multiple sources.

Edward G. Coffman Jr., B. M. Igelnik, Yakov A. Kogan

IEEE Trans. Inf. Theory, 1991

A Simple Proof of the <i>O</i>(sqrt(n log^3/4 <i>n</i>) Upright Matching Bound.

Edward G. Coffman Jr., Peter W. Shor

SIAM J. Discret. Math., 1991

Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study

Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Probabilistic analysis of packing and partitioning algorithms.

Edward G. Coffman Jr., George S. Lueker

Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-53272-9, 1991

1990

First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space.

Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

A Note Extending the Analysis of Two-Head Disk Systems to More General Seek-Time Characteristics.

A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto

IEEE Trans. Computers, 1989

Algorithms for Packing Squares: A Probabilistic Analysis.

Edward G. Coffman Jr., J. C. Lagarias

SIAM J. Comput., 1989

A Provably Efficient Algorithm for Dynamic Storage Allocation.

Edward G. Coffman Jr., Frank Thomson Leighton

J. Comput. Syst. Sci., 1989

Optimal Scheduling of Products with Two Subassemblies on a Single Machine.

Edward G. Coffman Jr., Ardavan Nozari, Mihalis Yannakakis

Oper. Res., 1989

1988

Optimal directory placement on disk storage devices.

A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto

J. ACM, 1988

1987

The forwarding index of communication networks.

Fan R. K. Chung, Edward G. Coffman Jr., Martin I. Reiman, Burton Simon

IEEE Trans. Inf. Theory, 1987

Polling and Greedy Servers on a Line.

Edward G. Coffman Jr., Edgar N. Gilbert

Queueing Syst. Theory Appl., 1987

Bin packing with divisible item sizes.

Edward G. Coffman Jr., M. R. Garey, David S. Johnson

J. Complex., 1987

Two Queues with Alternating Service Periods.

Edward G. Coffman Jr., Guy Fayolle, Isi Mitrani

Proceedings of the Performance '87, 1987

1986

A continuous polling system with constant service times.

Edward G. Coffman Jr., Edgar N. Gilbert

IEEE Trans. Inf. Theory, 1986

Queueing Models of Secondary Storage Devices.

Edward G. Coffman Jr., Micha Hofri

Queueing Syst. Theory Appl., 1986

Analysis of a Conveyor Queue in a Flexible Manufacturing System.

Edward G. Coffman Jr., Erol Gelenbe, Edgar N. Gilbert

Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, 1986

1985

Algorithms for Resolving Conflicts in Dynamic Storage Allocation

Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard

J. ACM, April, 1985

On the Asymptotic Optimality of First-Fit Storage Allocation.

Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp

IEEE Trans. Software Eng., 1985

A Stochastic Model of Fragmentation in Dynamic Storage Allocation.

Edward G. Coffman Jr., T. T. Kadota, Larry A. Shepp

SIAM J. Comput., 1985

Scheduling File Transfers.

Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh

SIAM J. Comput., 1985

Sequencing Problems in Two-Server Systems.

A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto

Math. Oper. Res., 1985

On the Expected Relative Performance of List Scheduling.

Edward G. Coffman Jr., Edgar N. Gilbert

Oper. Res., 1985

1984

Dynamic, First-Fit Packings in Two or More Dimensions

Edward G. Coffman Jr., Edgar N. Gilbert

Inf. Control., April, 1984

A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.

Ashok K. Agrawala, Edward G. Coffman Jr., M. R. Garey, Satish K. Tripathi

IEEE Trans. Computers, 1984

Insertion and Compaction Algorithms in Sequentially Allocated Storage.

Brenda S. Baker, Edward G. Coffman Jr.

SIAM J. Comput., 1984

Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum.

Edward G. Coffman Jr., Mihalis Yannakakis

Math. Oper. Res., 1984

A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors.

Edward G. Coffman Jr., Greg N. Frederickson, George S. Lueker

Math. Oper. Res., 1984

Optimum Head Separation in a Disk System with Two Read/Write Heads.

A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto

J. ACM, 1984

A Performance Guarantee for the Greedy Set-Partitioning Algorithm.

Edward G. Coffman Jr., Michael A. Langston

Acta Informatica, 1984

Recent Progress in the Performance Evaluation of Fundamental Allocation Algorithms.

Edward G. Coffman Jr.

Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1984

Expected Makespans for Largest-First Multiprocessor Scheduling.

Edward G. Coffman Jr., Leopold Flatto, George S. Lueker

Proceedings of the Performance '84, 1984

1983

Instruction Sets for Evaluating Arithmetic Expressions

Edward G. Coffman Jr., Ravi Sethi

J. ACM, July, 1983

Dynamic Bin Packing.

Edward G. Coffman Jr., M. R. Garey, David S. Johnson

SIAM J. Comput., 1983

Diffusion approximations for storage processes in computer systems.

Edward G. Coffman Jr., Martin I. Reiman

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 1983

Scheduling File Transfers in a Distributed Network.

Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh

Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

Diffusion Approximations for Computer/Communications Systems.

Edward G. Coffman Jr., Martin I. Reiman

Proceedings of the Computer Performance and Reliability, 1983

1982

A Data Base Replication Analysis Using an M/M/m Queue with Service Interruptions.

François Baccelli, Edward G. Coffman Jr.

Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1982

On the Expected Performance of Scanning Disks.

Edward G. Coffman Jr., Micha Hofri

SIAM J. Comput., 1982

A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation.

Brenda S. Baker, Edward G. Coffman Jr.

J. Algorithms, 1982

1981

Optimization of the Number of Copies in a Distributed Data Base.

Edward G. Coffman Jr., Erol Gelenbe, Brigitte Plateau

IEEE Trans. Software Eng., 1981

An analysis of parallel-read sequential-write systems.

Edward G. Coffman Jr., Henry O. Pollak, Erol Gelenbe, Roger C. Wood

Perform. Evaluation, 1981

1980

A Stochastic Model of Bin-Packing

Edward G. Coffman Jr., Kimming So, Micha Hofri, Andrew Chi-Chih Yao

Inf. Control., February, 1980

Optimal replication of parallel-read, sequential-write systems.

Edward G. Coffman Jr., Erol Gelenbe, Roger C. Wood

Proceedings of the 1980 International Symposium on Computer Performance Modelling, 1980

Optimization of the number of copies in a distribution data base.

Edward G. Coffman Jr., Erol Gelenbe, Brigitte Plateau

Proceedings of the 1980 International Symposium on Computer Performance Modelling, 1980

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms.

Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan

SIAM J. Comput., 1980

Orthogonal Packings in Two Dimensions.

Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest

SIAM J. Comput., 1980

A Characterization of Waiting Time Performance Realizable by Single-Server Queues.

Edward G. Coffman Jr., Isi Mitrani

Oper. Res., 1980

On the Comparison Between Single and Multiple Processor Systems.

Edward G. Coffman Jr., Kimming So

Proceedings of the 7th Annual Symposium on Computer Architecture, 1980

1979

Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation.

Edward G. Coffman Jr., Joseph Y.-T. Leung

SIAM J. Comput., 1979

1978

An Application of Bin-Packing to Multiprocessor Scheduling.

Edward G. Coffman Jr., M. R. Garey, David S. Johnson

SIAM J. Comput., 1978

A Class of FIFO Queues Arising in Computer Systems.

Edward G. Coffman Jr., Micha Hofri

Oper. Res., 1978

Bin Packing: Maximizing the Number of Pieces Packed.

Edward G. Coffman Jr., Joseph Y.-T. Leung, D. W. Ting

Acta Informatica, 1978

1977

On Scanning-Disks and the Analysis of their Steady State Behavior.

Edward G. Coffman Jr., Micha Hofri

Proceedings of the Measuring, Modelling and Evaluating Computer Systems, 1977

1976

On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server.

John L. Bruno, Edward G. Coffman Jr., D. B. Johnson

J. Comput. Syst. Sci., 1976

Errata: "Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices".

R. A. Cody, Edward G. Coffman Jr.

J. ACM, 1976

Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices.

R. A. Cody, Edward G. Coffman Jr.

J. ACM, 1976

Algorithms Minimizing Mean Flow Time: Schedule-Length Properties.

Edward G. Coffman Jr., Ravi Sethi

Acta Informatica, 1976

A generalized bound on LPT sequencing.

Edward G. Coffman Jr., Ravi Sethi

Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 1976

1975

Analysis of Interleaved Memory Systems Using Blockage Buffers.

G. J. Burnett, Edward G. Coffman Jr.

Commun. ACM, 1975

Selecting a Scheduling Rule that Meets Pre-Specified Response Time Demands.

Edward G. Coffman Jr., Isi Mitrani

Proceedings of the Fifth Symposium on Operating System Principles, 1975

1974

A Problem in Multiprogrammed Storage Allocation.

Thomas A. Ryan Jr., Edward G. Coffman Jr.

IEEE Trans. Computers, 1974

Synthesis of a Feedback Queueing Discipline for Computer Operation.

J. A. Michel, Edward G. Coffman Jr.

J. ACM, 1974

Scheduling Independent Tasks to Reduce Mean Finishing Time.

John L. Bruno, Edward G. Coffman Jr., Ravi Sethi

Commun. ACM, 1974

Algorithms for Minimizing Mean Flow Time.

John L. Bruno, Edward G. Coffman Jr., Ravi Sethi

Proceedings of the Information Processing, 1974

1973

A Combinatorial Problem Related to Interleaved Memory Systems.

G. J. Burnett, Edward G. Coffman Jr.

J. ACM, 1973

A Note on the Relative Performance of Two Disk Scanning Policies.

Edward G. Coffman Jr.

Inf. Process. Lett., 1973

Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract).

John L. Bruno, Edward G. Coffman Jr., Ravi Sethi

Proceedings of the Fourth Symposium on Operating System Principles, 1973

A Survey of Mathematical Results in Flow-Time Scheduling for Computer Systems.

Edward G. Coffman Jr.

Proceedings of the Gesellschaft für Informatik e.V., 1973

Operating Systems Theory

Edward G. Coffman Jr., Peter J. Denning

Prentice-Hall, 1973

1972

Analysis of Scanning Policies for Reducing Disk Seek Times.

Edward G. Coffman Jr., L. A. Klimko, Barbara Ryan

SIAM J. Comput., 1972

A Study of Storage Partitioning Using a Mathematical Model of Locality.

Edward G. Coffman Jr., T. A. Ryan

Commun. ACM, 1972

Optimal Scheduling for Two-Processor Systems.

Edward G. Coffman Jr., Ronald L. Graham

Acta Informatica, 1972

Consistency of Synchronization Nets using P and V Operations

John L. Bruno, Edward G. Coffman Jr., W. H. Hosken

Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972

1971

On the Performance of Interleaved Memories with Multiple-Word Bandwidths.

Edward G. Coffman Jr., Gerald Jay Burnett, Robert Archer Snowdon

IEEE Trans. Computers, 1971

System Deadlocks.

Edward G. Coffman Jr., M. J. Elphick, Arie Shoshani

ACM Comput. Surv., 1971

Performance Predictions for Extended Paged Memories.

Edward G. Coffman Jr., Brian Randell

Acta Informatica, 1971

A Study of Storage Partitioning Using a Mathematical Model (Abstract).

Edward G. Coffman Jr., T. A. Ryan

Proceedings of the Third Symposium on Operating System Principles, 1971

Nearly Optimal Binary Search Trees.

John L. Bruno, Edward G. Coffman Jr.

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971

Priority Paging Algorithms and the Extension Problem

Edward G. Coffman Jr., Neil D. Jones

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970

Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems.

Richard R. Muntz, Edward G. Coffman Jr.

J. ACM, 1970

Waiting Time Distributions for Processor-Sharing Systems.

Edward G. Coffman Jr., Richard R. Muntz, Hale F. Trotter

J. ACM, 1970

File structures using hashing functions.

Edward G. Coffman Jr., J. Eve

Commun. ACM, 1970

Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks

Arie Shoshani, Edward G. Coffman Jr.

Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970

Deadlock Problems in Computer Systems.

Edward G. Coffman Jr., M. J. Elphick, Arie Shoshani

Proceedings of the Rechnerstrukturen und Betriebsprogrammierung, 1970

A study of interleaved memory systems.

G. J. Burnett, Edward G. Coffman Jr.

Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1970 Spring Joint Computer Conference, 1970

1969

Optimal Preemptive Scheduling on Two-Processor Systems.

Richard R. Muntz, Edward G. Coffman Jr.

IEEE Trans. Computers, 1969

On the Tradeoff Between Response and Preemption Costs in a Foreground-Background Computer Service Discipline.

Edward G. Coffman Jr.

IEEE Trans. Computers, 1969

Erratum: "Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System".

Edward G. Coffman Jr.

J. ACM, 1969

Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System.

Edward G. Coffman Jr.

J. ACM, 1969

Organizing Matrices and Matrix Operations for Paged Memory Systems.

A. C. McKellar, Edward G. Coffman Jr.

Commun. ACM, 1969

Models of Pure time-sharing disciplines for resource allocation.

Edward G. Coffman Jr., Richard R. Muntz

Proceedings of the 24th national conference, 1969

1968

A Random-Walk Model of a Queue Storage Problem.

Edward G. Coffman Jr., Martin S. Schmookler

IEEE Trans. Computers, 1968

On the Motion of an Unbounded, Markov Queue in Random Access Storage.

Edward G. Coffman Jr., A. C. McKellar

IEEE Trans. Computers, 1968

A Simple Probability Model Yielding Performance Bounds for Modular Memory Systems.

Edward G. Coffman Jr.

IEEE Trans. Computers, 1968

Feedback Queueing Models for Time-Shared Systems.

Edward G. Coffman Jr., Leonard Kleinrock

J. ACM, 1968

Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping.

Edward G. Coffman Jr.

J. ACM, 1968

Further experimental data on the behavior of programs in a paging environment.

Edward G. Coffman Jr., Lee C. Varian

Commun. ACM, 1968

Computer scheduling methods and their countermeasures.

Edward G. Coffman Jr., Leonard Kleinrock

Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1968 Spring Joint Computer Conference, Atlantic City, NJ, USA, 30 April, 1968

1967

Distribution of Attained Service in Time-Shared Systems.

Leonard Kleinrock, Edward G. Coffman Jr.

J. Comput. Syst. Sci., 1967

An empirical study of the behavior of programs in a paging environment.

Lee C. Varian, Edward G. Coffman Jr.

Proceedings of the First Symposium on Operating Systems Principles, 1967

An analysis of computer operations under running time priority disciplines.

Edward G. Coffman Jr.

Proceedings of the ACM Symposium on Interactive Systems for Experimental Applied Mathematics, 1967

1966

Interarrival statistics for time sharing systems.

Edward G. Coffman Jr., Roger C. Wood

Commun. ACM, 1966

1964

A general-purpose time-sharing system.

Jules I. Schwartz, Edward G. Coffman Jr., Clark Weissman

Proceedings of the 1964 spring joint computer conference, 1964