- Polling Systems in Heavy Traffic: A Bessel Process Limit E. G. Coffman, Jr., y A. A. Puhalskii, # and M. I. Reiman y
- An Asymptotically Optimal Greedy Algorithm for Large Optical Burst Switching Systems
- [56] A. Van Vliet. An improved lower bound for online bin packing algorithms. Inform. Pro cess. Lett., 43:277--284, 1992.
- Optimal FaultTolerant Computing on Two Parallel John Bruno E. G. Coffman, Jr.
- [5] A. Dvoretzky and H. Robbins. On the ''parking'' problem. MTA Mat. Kut. Int. Kzl., 9:209--225, 196 4.
- Phase Transitions and Control in Self Assembly Yuliy Baryshnikov1
- Free-Drop TCP Yuliy Baryshnikov
- where the downward slide of the right stack is stopped (see Figure 1) have a width at least 1=3.
- Traffic Prediction on the Internet Y. Baryshnikov y , E. Coffman z , D. Rubenstein z , and B. Yimwadsana z
- Kelly's LAN Model Revisited Yuliy Baryshnikov
- Scheduling Saves in FaultTolerant Computations E. G. Coffman, Jr. 1 , Leopold Flatto 1 , A. Y. Kreinin 2
- To appear in SIAM J. DISCRETE MATHEMATICS Bin Packing with Discrete Item Sizes,
- Principles of Communication Systems: A Compact First Course
- Next Fit, 4--5, 25, 27--30 Smart, 28, 30
- Polling Systems with Zero Switchover Times: A HeavyTraffic Averaging Principle
- Recent Asymptotic Results in the Probabilistic Analysis of Schedule Makespans
- Packing Random Intervals E. G. Coffman, Jr., 1 Bjorn Poonen 2 and Peter Winkler 3
- On Creating Shapes in 2D Tile SelfAssembly We study the times to grow structures within the tile selfassembly model proposed by Winfree, and
- Bin Packing with Discrete Item Sizes Part II: AverageCase Behavior of FFD and BFD
- Controlling Robots of Web Search Engines J. Talim Z. Liu P. Nain
- To see this, observe that the only state produced on a departure from hA
- [1] G. B'ankovi. On gaps generated by a random space filling procedure. Math. Inst. Hung. Acad. Sci., 7:209225,1962.
- [103] M. Yue. On the exact upper bound for the multifit processor scheduling algorithm. Ann. Oper. Res., 24:233--259, 1991.
- On Times to Compute Shapes in 2D Tile Self-Assembly Yuliy Baryshnikov1
- [1] E. G. Coffman, Jr., Leopold Flatto, Predrag Jelenkovi'c, and Bjorn Poonen. Packing random intervals online (submitted for publication).
- Seamless SelfAssembly of Files in Cache Networks at Minimal Storage Cost
- [12] P. L'Ecuyer and J. Malenfant (1988). Computing Optimal Checkpointing Strategies for Rollback and Recovery Systems, IEEE Transactions on Computers, 37(4), 491--496.
- A Stochastic Checkpoint Optimization Problem E. G. Coffman, Jr., Leopold Flatto, Paul E. Wright
- ProcessorRing Communication: A Tight Asymptotic Bound on Packet Waiting Times
- The Gated, InfiniteServer Queue: Uniform Service Times Sid Browne 1 , E. G. Coffman, Jr. 2 , E. N. Gilbert 2 , Paul E. Wright 2
- An Asymptotic Probabilistic Analysis of Vehicle Routing E. G. Coffman, Jr.
- Lectures on Stochastic Matching: Guises and Applications E. G. Coffman, Jr.
- Incremental Self Assembly in the Fluid Limit Yuliy Baryshnikov1
- Probabilistic Analysis of Packing and Related Partitioning Problems E. G. Coffman, Jr., D. S. Johnson, and P. W. Shor
- 4 Parallel Processing Letters Research and Management Science, Vol. 4, North Holland, 1993, pp. 445522.
- 1 0.5 0 0.5 1 memory parameter w
- STOCHASTIC LIMIT LAWS FOR SCHEDULE MAKESPANS E. G. COFFMAN, Jr., 1 Leopold FLATTO 2 and Ward WHITT 3
- [15] A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications Academic Press, New York, 1979.
- Approximation Algorithms for Extensible Bin Packing E. G. Coffman, Jr. \Lambda George S. Lueker y
- Stochastic yield analysis of selfassembling, singleenzyme reaction networks
- Substituting back into (113) gives, after a little algebra, 4ff \Lambda +
- Ideal Preemptive Schedules on Two Processors E. G. Co man, Jr. 1 J. Sethuraman 2 V. G. Timkovsky 3
- !#"%$&'%()'0 1!224345687 9!@BAC@EDGFIHQPRQSTEU%@BVW@1AGFIX1Ya`IbTEU%@dce@EVCfhghiqprHsRtTu@dve@xw#yEfhRsfhb1xT`Ib1u@d@xw#fhbEgprH
- Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems
- Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
- The Dyadic Algorithm for Stream Merging E.G. Coffman, Jr. Predrag Jelenkovic Petar Momcilovic
- DNA-based Computation Times Yuliy Baryshnikov1
- the objective is to show that q(t) drifts from 1 to 0 in finite time. For this, it is sufficient to show that there exists a T ? 0 such that q(T ) ! 1 \Gamma '' for some fixed '' ? 0. In this case, a classical criterion (see
- Random-order bin packing Edward G. Coffman, Jr.
- Packing Rectangles in a Strip 1 E. G. Co man, Jr.
- Packing Random Rectangles E. G. Coffman 1;5 , George S. Lueker 2;6 , Joel Spencer 3 , and Peter M. Winkler 4
- Optimal, Seamless SelfAssembly of Files in Linear Networks
- [12] Fuwa, Y. and Tasaka, S., ``Register insertion type slotted rings: a performance analysis,'' IEEE proceedings (1991), 191--201.
- [5] K. D. Glazebrook. Scheduling tasks with exponential service times on parallel processors. J. Appl. Prob., 16:658--689, 1979.
- Network Engineering of Elastic Data Tra#c via Tandem Queueing Network Models
- Self-Correcting Self-Assembly: Growth Models and the Hammersley Process
- so on substituting into (14), one can conclude 1 \Gamma t ; t ! 0
- [1] V. E. Benes Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York, 1965.
- Mutual Exclusion Scheduling Brenda S. Baker
