Joan Feigenbaum

from Wikipedia, the free encyclopedia

Joan Feigenbaum (* 1958 in Brooklyn , New York City ) is an American computer scientist , mathematician and university professor. It is at the Yale University " Grace Murray Hopper Professor" for computer science and associate professor of jurisprudence .

life and work

Feigenbaum studied mathematics at Harvard University with a bachelor's degree and received his doctorate in 1986 from Stanford University under Andrew Yao with the dissertation: Product Graphs: Some Algorithmic and Combinatorial Results. In 2001 she received a Masters degree from Yale University . From 1986 to 2000 she worked in the research department at AT&T . Until 2005 she was Professor of Computer Science, until 2006 "Henry Ford II Professor of Computer Science" and then "Grace Murray Hopper Professor of Computer Science" at Yale University. She made fundamental and influential contributions to cryptographic complexity theory, for authorization and trust management, for data flow calculation and for the design of algorithmic mechanisms. She is also an adjunct professor in the law school.

She is married to Jeffrey Nussbaum and they have one son, Sam Baum.

Publications (selection)

  • J. Feigenbaum; B. Ford: Multiple Objectives of Lawful-Surveillance Protocols, in Proceedings of the 25th International Workshop on Security Protocols, Lecture Notes in Computer Science, volume 10476, Springer, pp. 1–8, 2017
  • J. Feigenbaum; B. Ford: Seeking Anonymity in an Internet Panopticon, Communications of the ACM 58:10, pp. 58-69, 2015
  • J. Feigenbaum; AD Jaggard; R. Wright: Towards a Formal Model of Accountability, in Proceedings of the 14th ACM New Security Paradigms Workshop, pp. 45-56, 2011
  • J. Feigenbaum; C. Papadimitriou, R. Sami; S. Shenker: A BGP-based Mechanism for Lowest-Cost Routing, Distributed Computing 18, pp. 61-72, 2005
  • with S. Kannan; M. Strauss; M. Viswanathan: Testing and Spot Checking of Data Streams, Algorithmica 34, pp. 67-80, 2002
  • with C. Papadimitriou; S. Shenker: Sharing the Cost of Multicast Transmissions, Journal of Computer and System Sciences, 63, pp. 21-41, 2001
  • with M. Blaze; M. Strauss: Compliance Checking in the PolicyMaker Trust-Management System, Proceedings of the 2nd Financial Crypto Conference, Lecture Notes in Computer Science, v. 1465, Springer, Berlin, pp. 254-274, 1998
  • with A. Condon; C. Lund; P. Shor: Random Debaters and the Hardness of Approximating Stochastic Functions, SIAM Journal on Computing 26, pp. 369-400, 1997

Honors and memberships

Web links