BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × USA
Collaborated with:
B.Awerbuch E.A.Brewer F.T.Chong M.T.Hajiaghayi J.H.Kim H.Räcke
Talks about:
random (2) rout (2) algorithm (1) hierarch (1) competit (1) approxim (1) scalabl (1) problem (1) network (1) exploit (1)

Person: Tom Leighton

DBLP DBLP: Leighton:Tom

Contributed to:

STOC 20052005
STOC 19941994

Wrote 3 papers:

STOC-2005-HajiaghayiKLR #graph #random
Oblivious routing in directed graphs with random demands (MTH, JHK, TL, HR), pp. 193–201.
STOC-1994-AwerbuchL #algorithm #approximate #multi #network #problem
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (BA, TL), pp. 487–496.
STOC-1994-BrewerCL #random #scalability
Scalable expanders: exploiting hierarchical random wiring (EAB, FTC, TL), pp. 144–152.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.