The following pages link to E. G. jun. Coffman (Q948705):
Displaying 50 items.
- (Q221780) (redirect page) (← links)
- An approximate model of processor communication rings under heavy load (Q287237) (← links)
- A performance analysis of channel fragmentation in dynamic spectrum access systems (Q383269) (← links)
- Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
- Batch sizing and job sequencing on a single machine (Q749439) (← links)
- Largest-first sequential selection with a sum constraint (Q753676) (← links)
- First-fit allocation of queues: Tight probabilistic bounds on wasted space (Q756295) (← links)
- A provably efficient algorithm for dynamic storage allocation (Q756873) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- A performance guarantee for the greedy set-partitioning algorithm (Q790814) (← links)
- Approximation algorithms for extensible bin packing (Q880529) (← links)
- Random-order bin packing (Q948706) (← links)
- Analysis of conveyor queue in a flexible manufacturing system (Q1099777) (← links)
- Bin packing with divisible item sizes (Q1100914) (← links)
- Queueing models of secondary storage devices (Q1105369) (← links)
- Polling and greedy servers on a line (Q1108180) (← links)
- Bin packing: Maximizing the number of pieces packed (Q1133327) (← links)
- Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
- Algorithms minimizing mean flow time: Schedule-length properties (Q1219159) (← links)
- On batch scheduling of jobs with stochastic service times and cost structures on a single server (Q1227237) (← links)
- Optimal robot scheduling for web search engines (Q1268846) (← links)
- Packing random intervals on-line (Q1277374) (← links)
- A selection-replacement process on the circle (Q1308703) (← links)
- The processor minimization problem with independent waiting-time constraints (Q1318710) (← links)
- Scheduling saves in fault-tolerant computations (Q1323350) (← links)
- Parking arcs on the circle with applications to one-dimensional communication networks (Q1345584) (← links)
- Mutual exclusion scheduling (Q1365931) (← links)
- Optimal fault-tolerant computing on multiprocessor systems (Q1386442) (← links)
- Packing rectangles in a strip (Q1403326) (← links)
- Ideal preemptive schedules on two processors (Q1424363) (← links)
- Interval packing: the vacant interval distribution. (Q1578611) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Bandwidth packing (Q1840503) (← links)
- Optimizing the number of robots for web search engines (Q1859049) (← links)
- Polling systems with zero switchover times: A heavy-traffic averaging principle (Q1909398) (← links)
- Performance of the move-to-front algorithm with Markov-modulated request sequences (Q1962831) (← links)
- Optimal seamless self-assembly of files in linear networks (Q2458911) (← links)
- Distribution of attained service in time-shared systems (Q2531552) (← links)
- Performance predictions for extended paged memories (Q2543770) (← links)
- Optimal scheduling for two-processor systems (Q2556224) (← links)
- Polling systems in heavy traffic: a Bessel process limit (Q2757533) (← links)
- Processor shadowing: Maximizing expected throughput in fault-tolerant systems (Q2757599) (← links)
- Approximation algorithms for extensible bin packing (Q2768352) (← links)
- Perfect packing theorems and the average-case behavior of optimal and online bin packing (Q2780629) (← links)
- Scheduling independent tasks to minimize the makespan on identical machines (Q2805367) (← links)
- The forwarding index of communication networks (Q3030727) (← links)
- Bin packing with discrete item sizes, part II: Tight bounds on First Fit (Q3122907) (← links)
- (Q3138904) (← links)
- (Q3145801) (← links)
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation (Q3208073) (← links)
