|
Susan Landau is an American mathematician and engineer, and Senior Staff Privacy Analyst at Google. She was a Guggenheim Fellow and a Visiting Scholar at the Computer Science Department, Harvard University in 2012.
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.
From 1999 until 2010, she specialized in internet security at Sun Microsystems.
In 1989, she introduced the first algorithm for deciding which nested radicals can be denested, which is known as Landau's algorithm.
In 1972, her project on odd perfect numbers won a finalist position in the Westinghouse Science Talent Search. 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", and an online bibliography of women's writing in computer science. She was awarded the 2008 Anita Borg Institute Women of Vision Award for Social Impact. In 2011 she was inducted as a Fellow of the Association for Computing Machinery.
|
