 | 1999 |
|---|
| 6 |       | Mor Harchol-Balter,
Frank Thomson Leighton,
Daniel Lewin:
Resource Discovery in Distributed Networks.
PODC 1999: 229-237 |
| 1998 |
|---|
| 5 | | Venkatesan Guruswami,
Daniel Lewin,
Madhu Sudan,
Luca Trevisan:
A Tight Characterization of NP with 3 Query PCPs.
FOCS 1998: 8-17 |
| 4 | | Daniel Lewin,
Salil P. Vadhan:
Checking Polynomial Identities over any Field: Towards a Derandomization?
STOC 1998: 438-447 |
| 3 | | Venkatesan Guruswami,
Daniel Lewin,
Madhu Sudan,
Luca Trevisan:
A tight characterization of NP with 3 query PCPs
Electronic Colloquium on Computational Complexity (ECCC) 5(34): (1998) |
| 1997 |
|---|
| 2 | | David R. Karger,
Eric Lehman,
Frank Thomson Leighton,
Rina Panigrahy,
Matthew S. Levine,
Daniel Lewin:
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.
STOC 1997: 654-663 |
| 1996 |
|---|
| 1 |  | Daniel Lewin,
Dean H. Lorenz,
Shmuel Ur:
A Methodology for Processor Implementation Verification.
FMCAD 1996: 126-142 |
