Monika Henzinger - Selected Publications#

Monika Henzinger has published over 200 papers with a total number of citations above 9.000 and h=43 (Harzing, Feb. 22, 2013).

K. Bharat and M. Henzinger. Improved Algorithms for Topic Distillation in Hyperlinked Environments. ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), 104-111, 1998. [982 citations]]

J. Dean and M. Henzinger. Finding Related Web Pages in the World Wide Web. Computer Networks, 31:1467-1479, 1999. [643 citations]]

M. Henzinger. Hyperlink Analysis for the Web. IEEE Internet Computing, 5(1):45-40 (2001). [223 citations]]

M. Henzinger and V. King. Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. Journal of the ACM, 4(4):502-516 (1999). [208 citations]]

5. S. Albers and M. Henzinger. Exploring Unknown Environments. SIAM Journal on Computing, 29(4):1164-1188 (2000). [187 citations]]

6. M. Henzinger. Finding Near-Duplicate Web Pages: A Large-Scale Evaluation of Algorithms. ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), 284-291, 2006. [186 citations]]

7. M. Henzinger. Search Technologies for the Internet. Science, 317(5837):468-471 (2007). [49 citations]]

8. J. Feldman, M. Henzinger, N. Korula, V. Mirrokni, and C. Stein. Online Stochastic Packing Applied to Display Ad Allocation. European Symposium on Algorithms (ESA), 182-194, 2010. [28 citations]]

9. K. Chatterjee and M. Henzinger. Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SIAM-ACM Symposium on Discrete Algorithms (SODA), 1318-1336, 2011. [9 citations]]

10. K. Chatterjee and M. Henzinger. An O(n2) Time Algorithm for Alternating Büchi Games. SIAM-ACM Symposium on Discrete Algorithms (SODA), 1386-1399, 2012.

Monika Henzinger is the co-inventor of 59 patents granted by the US Patent Office.