| Synthesis of local-rule processes: successes and challenges (abstract only) | 0 | 0.34 | 2012 |
| On times to compute shapes in 2d tile self-assembly | 0 | 0.34 | 2006 |
| Approximation Algorithms for Extensible Bin Packing | 14 | 1.85 | 2006 |
| Self-correcting self-assembly: growth models and the hammersley process | 12 | 1.16 | 2005 |
| Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2004, June 10-14, 2004, New York, NY, USA | 7 | 1.42 | 2004 |
| DNA-based computation times | 14 | 1.45 | 2004 |
| Self assembly times in DNA-based computation | 1 | 0.35 | 2004 |
| Packing Random Intervals On-Line | 2 | 0.79 | 1998 |
| A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound | 0 | 0.34 | 1991 |
| Scheduling File Transfers | 57 | 14.65 | 1985 |
| A Stochastic Model of Fragmentation in Dynamic Storage Allocation | 11 | 3.57 | 1985 |
| Dynamic Bin Packing | 60 | 8.29 | 1983 |
| On the Expected Performance of Scanning Disks | 21 | 5.45 | 1982 |
| Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms | 237 | 65.53 | 1980 |
| Orthogonal Packings In 2 Dimensions | 273 | 63.01 | 1980 |
| An Application of Bin-Packing to Multiprocessor Scheduling | 237 | 56.11 | 1978 |
| On Scanning-Disks and the Analysis of their Steady State Behavior | 4 | 1.21 | 1977 |
| Scheduling independent tasks to reduce mean finishing time | 203 | 125.30 | 1974 |
| Scheduling independent tasks to reduce mean finishing-time (extended abstract) | 5 | 28.25 | 1973 |
| A Study of Storage Partitioning Using a Mathematical Model (Abstract) | 0 | 0.34 | 1971 |
