Authors:
Andrews, M
Awerbuch, B
Fernandez, A
Leighton, T
Liu, ZY
Kleinberg, J
Citation: M. Andrews et al., Universal-stability results and performance bounds for greedy contention-resolution protocols, J ACM, 48(1), 2001, pp. 39-69
Citation: T. Leighton et al., New algorithmic aspects of the local lemma with applications to routing and partitioning, SIAM J COMP, 31(2), 2001, pp. 626-641
Authors:
Andrews, M
Fernandez, A
Harchol-Balter, M
Leighton, T
Zhang, L
Citation: M. Andrews et al., General dynamic routing with per-packet delay guarantees of O(distance+1/session rate), SIAM J COMP, 30(5), 2000, pp. 1594-1623
Authors:
Ribble, C
Hunter, B
Lariviere, M
Belanger, D
Wobeser, G
Daoust, PY
Leighton, T
Waltner-Toews, D
Davidson, J
Spangler, E
Nielsen, O
Citation: C. Ribble et al., Ecosystem health as a clinical rotation for senior students in Canadian veterinary schools, ECOSYST HEA, 5(2), 1999, pp. 118-124
Citation: T. Leighton et S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J ACM, 46(6), 1999, pp. 787-832
Citation: T. Leighton et Ya. Ma, Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults, SIAM J COMP, 29(1), 1999, pp. 258-273