The following pages link to Edward G. jun. Coffman (Q948705):
Displayed 50 items.
- (Q3214414) (← links)
- Sequencing two servers on a sphere (Q3217405) (← links)
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (Q3222847) (← links)
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors (Q3309057) (← links)
- A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors (Q3325433) (← links)
- Insertion and Compaction Algorithms in Sequentially Allocated Storage (Q3335008) (← links)
- Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum (Q3343749) (← links)
- (Q3347319) (← links)
- Stochastic Models of Queue Storage (Q3415872) (← links)
- Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines (Q3415915) (← links)
- Tandem Conveyor Queues (Q3415950) (← links)
- Storage-Limited Queues in Heavy Traffic (Q3416028) (← links)
- Gated, Exhaustive, Parallel Service (Q3416045) (← links)
- Optimal strategies for scheduling checkpoints and preventive maintenance (Q3483057) (← links)
- Self-correcting Self-assembly: Growth Models and the Hammersley Process (Q3618676) (← links)
- Dynamic Bin Packing (Q3657446) (← links)
- An Introduction to Combinatorial Models of Dynamic Storage Allocation (Q3670545) (← links)
- On the Expected Relative Performance of List Scheduling (Q3686419) (← links)
- Dynamic, first-fit packings in two or more dimensions (Q3719853) (← links)
- Sequencing Problems in Two-Server Systems (Q3724071) (← links)
- Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem (Q3727103) (← links)
- Scheduling File Transfers (Q3741046) (← links)
- A Stochastic Model of Fragmentation in Dynamic Storage Allocation (Q3742707) (← links)
- Minimizing expected makespans on uniform processor systems (Q3754427) (← links)
- Instruction Sets for Evaluating Arithmetic Expressions (Q3765252) (← links)
- Algorithms for resolving conflicts in dynamic storage allocation (Q3766837) (← links)
- Optimum Head Separation in a Disk System with Two Read/Write Heads (Q3766838) (← links)
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics (Q3779988) (← links)
- Algorithms for Packing Squares: A Probabilistic Analysis (Q3823793) (← links)
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine (Q3826355) (← links)
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms (Q3893333) (← links)
- Orthogonal Packings in Two Dimensions (Q3893334) (← links)
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues (Q3898315) (← links)
- Optimization of the Number of Copies in a Distributed Data Base (Q3902553) (← links)
- An analysis of parallel-read sequential-write systems (Q3914422) (← links)
- On the Expected Performance of Scanning Disks (Q3936188) (← links)
- (Q3949968) (← links)
- (Q3957935) (← links)
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing (Q3960135) (← links)
- A two-dimensional bin-packing model of preemptive, FIFO storage allocation (Q3964025) (← links)
- (Q3979293) (← links)
- Controlled stochastic model of a communication system with multiple sources (Q3980932) (← links)
- Height distributions in data communication buffers with locking protocols (Q3981801) (← links)
- A distributed clustering process (Q3988114) (← links)
- On the Optimal Stochastic Scheduling of Out-Forests (Q3990565) (← links)
- Scheduling Checks and Saves (Q3993668) (← links)
- (Q4002885) (← links)
- Service by a Queue and a Cart (Q4018308) (← links)
- Paths through a maze of rectangles (Q4018994) (← links)
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands (Q4032588) (← links)