2016 - ACM Fellow For contributions to computing theory and its practical application.
2014 - European Association for Theoretical Computer Science (EATCS) Fellow For being one of the pioneers of web algorithms, algorithms that deal with problems of the world wide web
2013 - Member of Academia Europaea
Monika Henzinger mostly deals with Information retrieval, Combinatorics, Search engine, Web page and Discrete mathematics. Her Information retrieval research is multidisciplinary, relying on both Graph and Data mining. Her research integrates issues of Connectivity and Directed graph in her study of Graph.
Combinatorics is frequently linked to Dynamic problem in her study. Her biological study spans a wide range of topics, including The Internet and Information needs. Monika Henzinger has included themes like Random projection and Scale in her Web page study.
Monika Henzinger mainly investigates Combinatorics, Algorithm, Discrete mathematics, Upper and lower bounds and Information retrieval. Her Combinatorics research integrates issues from Dynamic problem and Amortized analysis. While the research belongs to areas of Algorithm, Monika Henzinger spends her time largely on the problem of Graph, intersecting her research to questions surrounding Connectivity.
Her study in Discrete mathematics is interdisciplinary in nature, drawing from both Matching, Graph theory and Approximation algorithm. Her study looks at the intersection of Upper and lower bounds and topics like Online algorithm with Theoretical computer science. Monika Henzinger combines subjects such as Web page, World Wide Web and Data mining with her study of Information retrieval.
Combinatorics, Algorithm, Graph, Dynamic problem and Upper and lower bounds are her primary areas of study. Her Combinatorics research incorporates elements of Amortized analysis and Set cover problem. Her Algorithm research is multidisciplinary, incorporating perspectives in Sequence and Enhanced Data Rates for GSM Evolution.
Her studies in Graph integrate themes in fields like Graph and Shared memory. Her Dynamic problem study combines topics from a wide range of disciplines, such as Combinatorial algorithms, Set, Approximation algorithm, Algebraic number and Polynomial. Her work deals with themes such as Distributed algorithm, Type, Reduction and Data structure, which intersect with Discrete mathematics.
Her main research concerns Combinatorics, Algorithm, Dynamic problem, Upper and lower bounds and Minimum cut. Her Combinatorics study focuses on Undirected graph in particular. Her work in Algorithm is not limited to one particular discipline; it also encompasses Graph.
Her Dynamic problem study combines topics in areas such as Set and Approximation algorithm. Her Upper and lower bounds study also includes fields such as
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Analysis of a very large web search engine query log
Craig Silverstein;Hannes Marais;Monika Henzinger;Michael Moricz.
international acm sigir conference on research and development in information retrieval (1999)
Improved algorithms for topic distillation in a hyperlinked environment
Krishna Bharat;Monika R. Henzinger.
international acm sigir conference on research and development in information retrieval (1998)
Finding related pages in the World Wide Web
Jeffrey Dean;Monika R. Henzinger.
the web conference (1999)
Continuous profiling: where have all the cycles gone?
Jennifer M. Anderson;Lance M. Berc;Jeffrey Dean;Sanjay Ghemawat.
symposium on operating systems principles (1997)
Information retrieval based on historical data
Anurag Acharya;Matt Cutts;Jeffrey Dean;Paul Haahr.
(2004)
Information retrieval based on historical data
Jeffrey Dean;Paul Haahr;Monika Henzinger;Steve Lawrence.
(2004)
Computing simulations on finite and infinite graphs
M.R. Henzinger;T.A. Henzinger;P.W. Kopke.
foundations of computer science (1995)
Computing on data streams
Monika R. Henzinger;Prabhakar Raghavan;Sridhar Rajagopalan.
External memory algorithms (1999)
Finding near-duplicate web pages: a large-scale evaluation of algorithms
Monika Henzinger.
international acm sigir conference on research and development in information retrieval (2006)
Analysis of a Very Large AltaVista Query Log
Craig Silverstein;Monika Henzinger;Hannes Marais;Michael Moricz.
(1998)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Institute of Science and Technology Austria
University of Copenhagen
Saarland University
Google (United States)
University of California, Berkeley
Google (United States)
Google (United States)
Guido Carli Free International University for Social Studies
University of Copenhagen
Sapienza University of Rome
New York University
American University
University at Buffalo, State University of New York
Zhejiang University
Centers for Disease Control and Prevention
University of Namur
Chongqing Jiaotong University
Nara Institute of Science and Technology
Boston University
Chinese Academy of Sciences
Leibniz Institute DSMZ – German Collection of Microorganisms and Cell Cultures
Sorbonne University
Pennsylvania State University
Environment and Climate Change Canada
Goddard Space Flight Center
University of Rostock