Theory of Networked Computing? [.ppt]
Joan Feigenbaum, Invited talk at the final workshop for the DELIS project, February 27, 2008
Earlier versions given at FuDiDo III and at DIMACS in 2007.
Suitable for a Theoretical Computer Science audience

Incentive-Compatible Interdomain Routing [.ppt]
Vijay Ramachandran, Talk at 2006 Conference on Electronic Commerce, June 13, 2006
Suitable for a Theoretical Computer Science audience or a Networking audience

Progress on the PORTIA Project [.ppt]
Joan Feigenbaum, Colloquium given at Google on June 5, 2006
Earlier versions given at Stevens, Rutgers, NYU, and University of Michigan in 2004 and 2005.
Suitable for a general Computer Science audience

Massive Data Streams in Graph Theory and Computational Geometry [.ppt]
Jian Zhang, Thesis defense, June 15, 2005
Suitable for a Theoretical Computer Science audience

Foundations of Inter-Domain Routing [.ppt]
Vijay Ramachandran, Thesis defense, April 20, 2005
Suitable for a general Computer Science audience

Are "Trusted Platforms" Useful for Privacy Protection? [.ppt]
Joan Feigenbaum, PORTIA Workshop at Stanford, July 7-8, 2004.
Suitable for a Computer Science audience or a Law-and-Technology audience.

Privacy, Integrity, and Incentive Compatibility in Computations with Untrusted Parties [.ppt], [.pdf]
Sheng Zhong, Thesis defense, June 29, 2004
Suitable for a general Computer Science audience

Incentives and Internet Algorithms [.ppt], [.pdf]
Joan Feigenbaum and Scott Shenker, Tutorial at 2004 Conf. on Integer Programming and Combinatorial Optimization, June 7, 2004
Suitable for a Theoretical Computer Science audience
(Supercedes earlier survey talks given at Stanford, Columbia, NEC, Microsoft, DIALM'02, and PODC'03.)

Control of Personal Information [.ppt], [.pdf]
Joan Feigenbaum and Peter Swire, Dialogue between a Technologist and a Lawyer given at Harvard on April 23, 2004
Suitable for a general audience.

Sensitive Information in a Wired World [.ppt], [.pdf]
Joan Feigenbaum, Overview of the PORTIA project given at Univ. of Michigan on April 8, 2004
Suitable for a "law and technology" audience.
(Supercedes earlier versions of this talk given at Yale Law School and NYU Law School.)

Computation in a Distributed Information Market [.ppt], [.pdf]
Rahul Sami, Talk at 2003 Conference on Electronic Commerce, June 12, 2003
Suitable for a Theoretical Computer Science audience

Distributed Algorithmic Mechanism Design for Network Problems [.ppt], [.pdf]
Rahul Sami, Thesis defense, May 7, 2003
Suitable for a general Computer Science audience

Computing Diameter in the Streaming and Sliding-Window Models [.ppt]
Jian Zhang, Talk at a DIMACS MDS Working-Group meeting, March 25, 2003
Suitable for a Theoretical Computer Science audience

A BGP-based Mechanism for Lowest-Cost Routing [.ppt], [.pdf]
Rahul Sami, Talk at 2002 Symp. on Principles of Distributed Computing, July 23, 2002
Suitable for a general Computer Science audience

Fundamental Open Questions in Distributed Mechanism Design [.ps], [.pdf]
Scott Shenker, Workshop Talk at DIMACS, October 31, 2001
DAMD Overview suitable for an Economics audience