STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Bounded space on-line bin packing: best is better than first
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
Markov chains, computer proofs, and average-case analysis of best fit bin packing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Average-case analyses of first fit and random fit bin packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ACM SIGMETRICS Performance Evaluation Review
Acta Cybernetica
Linear waste of best fit bin packing on skewed distributions
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Fast Template Placement for Reconfigurable Computing Systems
IEEE Design & Test
A Self Organizing Bin Packing Heuristic
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Stochastic Bandwidth Packing Process: Stability Conditions via Lyapunov Function Technique
Queueing Systems: Theory and Applications
Quickly finding near-optimal storage designs
ACM Transactions on Computer Systems (TOCS)
Average-case competitive analyses for one-way trading
Journal of Combinatorial Optimization
From balls and bins to points and vertices
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Expected performance of the shelf heuristic for 2-dimensional packing
Operations Research Letters
| Hi-index | 0.00 |