D. Lewin

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

David R. Karger, Frank Thomson Leighton, Rina Panigrahy, 1997, STOC '97.

Consistent hashing and random trees : algorithms for caching in distributed networks

Daniel M. Lewin, D. Lewin, 1998 .

Checking polynomial identities over any field: towards a derandomization?

Salil P. Vadhan, Daniel Lewin, S. Vadhan, 1998, STOC '98.

Randomness in Distributed Protocols

Alfredo De Santis, Carlo Blundo, Ugo Vaccaro, 1994 .

Checking polynomial identities over any field: towards a derandomization?

S. Vadhan, D. Lewin, 1998, STOC '98.

Resource discovery in distributed networks

Mor Harchol-Balter, Frank Thomson Leighton, Daniel Lewin, 1999, PODC '99.