Travelled to:1 × Canada
1 × USA
Collaborated with:R.Panigrahy E.Fischer I.Newman S.Raskhodnikova R.Rubinfeld A.Samorodnitsky D.R.Karger F.T.Leighton M.S.Levine D.Lewin M.Charikar D.Liu M.Prabhakaran A.Rasala A.Sahai A.Shelat
Talks about:kolmogorov (1) distribut (1) smallest (1) protocol (1) approxim (1) monoton (1) grammar (1) general (1) consist (1) complex (1)
Person: Eric Lehman
DBLP: Lehman:Eric
Contributed to:
20021997Wrote 3 papers:
- STOC-2002-CharikarLLPPRSS #approximate #complexity #modelling
- Approximating the smallest grammar: Kolmogorov complexity in natural models (MC, EL, DL, RP, MP, AR, AS, AS), pp. 792–801.
- STOC-2002-FischerLNRRS #testing
- Monotonicity testing over general poset domains (EF, EL, IN, SR, RR, AS), pp. 474–483.
- STOC-1997-KargerLLPLL #consistency #distributed #protocol #random #web
- Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (DRK, EL, FTL, RP, MSL, DL), pp. 654–663.