Biased random walks, Proc. 24th Ann. ACM Symp. on Theory of Computing, pp.1-9, 1992. ,
Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin-packing case study. I n Proc. 23rd A nn, ACM Symp. on Theory of Computing, pp.230-240, 1991. ,
Markov chains, computer proofs, and average-case analysis of Best Fit bin packing, Proc. 25th Ann. ACM Symp. on Theory of Computing, pp.412-421, 1993. ,
Constructive Theory of Countable Markov Chains (Part I), 1992. ,
, An I n t r oduction to Probability Theory and its Applications, vol.I, 1968.
On stochastic matrices associated with certain queueing processes, Ann. Math. Stat, vol.24, pp.355-360, 1953. ,
Hitting-time and occupation-time bounds implied by drift analysis with applications, Adv. Appl. Prob, vol.14, pp.502-525, 1982. ,
Worst case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput, vol.3, pp.299-325, 1974. ,
Average case analysis of greedy routing algorithms on arrays, Proc. 2nd Ann. ACM Symp. on Parallel Algorithms and Architectures, pp.2-10, 1990. ,
Ergodicity, c o n tinuity, and analyticity of countable Markov c hains, Trans. Moscow Math. Soc, vol.39, pp.3-48, 1979. ,
The average case analysis of some on-line algorithms for binpacking, Combinatorica, vol.6, pp.179-200, 1986. ,