|
|
|
Monika Henzinger
|
|
|
|
BIOGRAPHY
|
Monika Henzinger received her PhD in 1993 from Princeton University and joined the Computer Science Department at Cornell University as assistant professor. In 1996, she became a member of technical staff at the Systems Research Center of Digital Equipment Corporation. A few years later, she joined Google as the Director of Research. Since 2005, she has been a faculty member at the School of Computer & Communication Sciences of EPFL, heading the Laboratory of Theory and Applications of Algorithms.
Dr. Henzinger is a recipient of an NSF CAREER Award, an European Young Investigator Award, and a Top 25 Women on the Web Award and she is a co-recipient of the SOSP 1997 Best Paper Award.
|
|
MAIN PUBLICATIONS
|
|
|
M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian.
Faster Shortest-Path Algorithms for Planar Graphs.
J. Comput. Syst. Sci., 55(1):3-23, 1997.
[ Details |
Link ]
|
|
|
M. R. Henzinger and V. King.
Randomized fully dynamic graph algorithms with polylogarithmic time
per operation.
J ACM, 46(4):502-516, 1999.
[ Details |
Full Text |
Link ]
|
|
|
M. R. Henzinger.
Search Technologies for the Internet.
Science, 317(5837):468-471, 2007.
Henzinger M.
[ Details |
Link ]
|
|
|
FURTHER PUBLICATIONS
|
Publications to download
DBLP Entry
|
|
CURRENT WORK
|
Analysis of the World Wide Web: Develop algorithms for analyzing properties of the World Wide Web
Efficient Algorithms for Web Search Engines: Study novel algorithmic problems arising in web search engines
|
|
Funding
|
|
European Young Investigator Award
|
|
|