AAAAAA

   
Results: 1-16 |
Results: 16
POLLING SYSTEMS IN HEAVY TRAFFIC - A BESSEL PROCESS LIMIT
Authors: COFFMAN EG PUHALSKII AA REIMAN MI
Citation: Eg. Coffman et al., POLLING SYSTEMS IN HEAVY TRAFFIC - A BESSEL PROCESS LIMIT, Mathematics of operations research, 23(2), 1998, pp. 257-304
THE MAXIMUM OF A RANDOM-WALK AND ITS APPLICATION TO RECTANGLE PACKING
Authors: COFFMAN EG FLAJOLET P FLATTO L HOFRI M
Citation: Eg. Coffman et al., THE MAXIMUM OF A RANDOM-WALK AND ITS APPLICATION TO RECTANGLE PACKING, Probability in the engineering and informational sciences, 12(3), 1998, pp. 373-386
PACKING RANDOM INTERVALS ONLINE
Authors: COFFMAN EG FLATTO L JELENKOVIC P POONEN B
Citation: Eg. Coffman et al., PACKING RANDOM INTERVALS ONLINE, Algorithmica, 22(4), 1998, pp. 448-476
PROCESSOR-RING COMMUNICATION - A TIGHT ASYMPTOTIC BOUND ON PACKET WAITING-TIMES
Authors: COFFMAN EG KHALE N LEIGHTON FT
Citation: Eg. Coffman et al., PROCESSOR-RING COMMUNICATION - A TIGHT ASYMPTOTIC BOUND ON PACKET WAITING-TIMES, SIAM journal on computing, 27(5), 1998, pp. 1221-1236
BIN PACKING WITH DISCRETE ITEM SIZES .2. TIGHT BOUNDS ON FIRST FIT
Authors: COFFMAN EG JOHNSON DS SHOR PW WEBER RR
Citation: Eg. Coffman et al., BIN PACKING WITH DISCRETE ITEM SIZES .2. TIGHT BOUNDS ON FIRST FIT, Random structures & algorithms, 10(1-2), 1997, pp. 69-101
SCHEDULING 2-POINT STOCHASTIC JOBS TO MINIMIZE THE MAKESPAN ON 2 PARALLEL MACHINES
Authors: BORST S BRUNO J COFFMAN EG PHILLIPS S
Citation: S. Borst et al., SCHEDULING 2-POINT STOCHASTIC JOBS TO MINIMIZE THE MAKESPAN ON 2 PARALLEL MACHINES, Probability in the engineering and informational sciences, 11(1), 1997, pp. 95-105
AN APPROXIMATE MODEL OF PROCESSOR COMMUNICATION RINGS UNDER HEAVY LOAD
Authors: COFFMAN EG FLATTO L GILBERT EN GREENBERG AG
Citation: Eg. Coffman et al., AN APPROXIMATE MODEL OF PROCESSOR COMMUNICATION RINGS UNDER HEAVY LOAD, Information processing letters, 64(2), 1997, pp. 61-67
OPTIMAL FAULT-TOLERANT COMPUTING ON MULTIPROCESSOR SYSTEMS
Authors: BRUNO J COFFMAN EG
Citation: J. Bruno et Eg. Coffman, OPTIMAL FAULT-TOLERANT COMPUTING ON MULTIPROCESSOR SYSTEMS, Acta informatica, 34(12), 1997, pp. 881-904
MUTUAL EXCLUSION SCHEDULING
Authors: BAKER BS COFFMAN EG
Citation: Bs. Baker et Eg. Coffman, MUTUAL EXCLUSION SCHEDULING, Theoretical computer science, 162(2), 1996, pp. 225-243
PACKING RANDOM INTERVALS
Authors: COFFMAN EG POONEN B WINKLER P
Citation: Eg. Coffman et al., PACKING RANDOM INTERVALS, Probability theory and related fields, 102(1), 1995, pp. 105-121
THE PROCESSOR MINIMIZATION PROBLEM WITH INDEPENDENT WAITING-TIME CONSTRAINTS
Authors: COFFMAN EG FLATTO L POONEN B WRIGHT PE
Citation: Eg. Coffman et al., THE PROCESSOR MINIMIZATION PROBLEM WITH INDEPENDENT WAITING-TIME CONSTRAINTS, Theoretical computer science, 125(1), 1994, pp. 3-16
STOCHASTIC MACHINE MINIMIZATION WITH CONSTANT SERVICE TIMES
Authors: COFFMAN EG FLATTO L WRIGHT PE
Citation: Eg. Coffman et al., STOCHASTIC MACHINE MINIMIZATION WITH CONSTANT SERVICE TIMES, Mathematics of operations research, 18(2), 1993, pp. 300-316
A STOCHASTIC CHECKPOINT OPTIMIZATION PROBLEM
Authors: COFFMAN EG FLATTO L WRIGHT PE
Citation: Eg. Coffman et al., A STOCHASTIC CHECKPOINT OPTIMIZATION PROBLEM, SIAM journal on computing, 22(3), 1993, pp. 650-659
STOCHASTIC-ANALYSIS OF A SLOTTED FIFO COMMUNICATION CHANNEL
Authors: COFFMAN EG HALFIN S JEANMARIE A ROBERT P
Citation: Eg. Coffman et al., STOCHASTIC-ANALYSIS OF A SLOTTED FIFO COMMUNICATION CHANNEL, IEEE transactions on information theory, 39(5), 1993, pp. 1555-1566
PROOF OF THE 4 3 CONJECTURE FOR PREEMPTIVE VS NONPREEMPTIVE 2-PROCESSOR SCHEDULING/
Authors: COFFMAN EG GAREY MR
Citation: Eg. Coffman et Mr. Garey, PROOF OF THE 4 3 CONJECTURE FOR PREEMPTIVE VS NONPREEMPTIVE 2-PROCESSOR SCHEDULING/, Journal of the Association for Computing Machinery, 40(5), 1993, pp. 991-1018
SCHEDULING SAVES IN FAULT-TOLERANT COMPUTATIONS
Authors: COFFMAN EG FLATTO L KREININ AY
Citation: Eg. Coffman et al., SCHEDULING SAVES IN FAULT-TOLERANT COMPUTATIONS, Acta informatica, 30(5), 1993, pp. 409-423
Risultati: 1-16 |