Susan Landau

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Susan Landau (born ca. 1955) is an American mathematician and engineer, as of 2011, a Visiting Scholar at the Computer Science Department, Harvard University.[1]

In 2010-2011, she was a Fellow at the Radcliffe Institute for Advanced Study at Harvard, where she investigated issues involving security of government systems, and their privacy and policy implications.[2]

From 1999 until 2010, she specialized in internet security at Sun Microsystems.[3] In 1989 she introduced the first algorithm for deciding which nested radicals can be denested.[4]

In 1972, her project on odd perfect numbers won a finalist position in the Westinghouse Science Talent Search.[5] Outside of her technical work, she is interested in the issues of women in science, maintaining the ResearcHers Email list, a "forum for women computer science researchers",[6] and an online bibliography of women's writing in computer science.[7] She was awarded the 2008 Anita Borg Institute Women of Vision Award for Social Impact[8]. In 2011 she was inducted as a Fellow of the Association for Computing Machinery[9].

Contents

[edit] See also

[edit] Notes

[edit] References

[edit] External links

Personal tools
Namespaces
Variants
Actions
Navigation
Interaction
Toolbox
Print/export
Languages