Daniel Lewin

According to our database, Daniel Lewin authored at least 5 papers between 1996 and 1999.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1999

Resource Discovery in Distributed Networks.

Mor Harchol-Balter, Frank Thomson Leighton, Daniel Lewin

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998

A tight characterization of NP with 3 query PCPs

Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan

Electron. Colloquium Comput. Complex., 1998

Checking Polynomial Identities over any Field: Towards a Derandomization?

Daniel Lewin, Salil P. Vadhan

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.

David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

A Methodology for Processor Implementation Verification.

Daniel Lewin, Dean H. Lorenz, Shmuel Ur

Proceedings of the Formal Methods in Computer-Aided Design, First International Conference, 1996