| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Monika Rauch Henzinger Monika Rauch Henzinger: Algorithmic Aspects of Web Search Engines. ESA 2004 : 3 Monika Rauch Henzinger: The Past, Present, and Future of Web Search Engines p. ICALP 2004 : 3 Monika Rauch Henzinger: The Past, Present and Future of Web Information Retrieval. PODS 2004 : 46 Monika Rauch Henzinger, Rajeev Motwani , Craig Silverstein : Challenges in Web Search Engines. IJCAI 2003 : 1573-1579 Monika Rauch Henzinger: The Past, Present and Future of Web Information Retrieval. INFOS 2003 : 57-57 Monika Rauch Henzinger, Bay-Wei Chang , Brian Milch , Sergey Brin : Query-free news search. WWW 2003 : 1-10 Ashish Goel , Monika Rauch Henzinger, Serge A. Plotkin , Éva Tardos : Scheduling data transfers in a network and the set scheduling problem. J. Algorithms 48 (2): 314-332 (2003) Monika Rauch Henzinger, Stefano Leonardi : Scheduling multicasts on unit-capacity trees and meshes. J. Comput. Syst. Sci. 66 (3): 567-611 (2003) Monika Rauch Henzinger: Indexing the Web - A Challenge for Supercomputers. CLUSTER 2002 : 343-343 Monika Rauch Henzinger, Rajeev Motwani , Craig Silverstein : Challenges in web search engines. SIGIR Forum 36 (2): 11-22 (2002) Krishna Bharat , Bay-Wei Chang , Monika Rauch Henzinger, Matthias Ruhl : Who Links to Whom: Mining Linkage between Web Sites. ICDM 2001 : 51-58 Monika Rauch Henzinger: Hyperlink Analysis for the Web. IEEE Internet Computing 5 (1): 45-50 (2001) Monika Rauch Henzinger, Valerie King : Maintaining Minimum Spanning Forests in Dynamic Graphs. SIAM J. Comput. 31 (2): 364-374 (2001) Monika Rauch Henzinger: Web Information Retrieval - an Algorithmic Perspective. ESA 2000 : 1-8 Monika Rauch Henzinger: Web Information Retrieval. ICDE 2000 : 693 Monika Rauch Henzinger, Allan Heydon , Michael Mitzenmacher , Marc Najork : On near-uniform URL sampling. Computer Networks 33 (1-6): 295-308 (2000) Monika Rauch Henzinger: Link Analysis in Web Information Retrieval. IEEE Data Eng. Bull. 23 (3): 3-8 (2000) Krishna Bharat , Andrei Z. Broder , Jeffrey Dean , Monika Rauch Henzinger: A Comparison of Techniques to Find Mirrored Hosts on the WWW. IEEE Data Eng. Bull. 23 (4): 21-26 (2000) Monika Rauch Henzinger, Satish Rao , Harold N. Gabow : Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34 (2): 222-250 (2000) Krishna Bharat , Andrei Z. Broder , Jeffrey Dean , Monika Rauch Henzinger: A comparison of techniques to find mirrored hosts on the WWW. JASIS 51 (12): 1114-1122 (2000) Susanne Albers , Monika Rauch Henzinger: Exploring Unknown Environments. SIAM J. Comput. 29 (4): 1164-1188 (2000) Monika Rauch Henzinger: Improved Data Structures for Fully Dynamic Biconnectivity. SIAM J. Comput. 29 (6): 1761-1815 (2000) Monika Rauch Henzinger, Stefano Leonardi : Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999 : 438-447 Ashish Goel , Monika Rauch Henzinger, Serge A. Plotkin , Éva Tardos : Scheduling Data Transfers in a Network and the Set Scheduling Problem. STOC 1999 : 189-197 Krishna Bharat , Andrei Z. Broder , Jeffrey Dean , Monika Rauch Henzinger: A Comparison of Techniques to Find Mirrored Hosts on the WWW. WOWS 1999 : 2-12 Monika Rauch Henzinger, Valerie King , Tandy Warnow : Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. Algorithmica 24 (1): 1-13 (1999) Monika Rauch Henzinger, Allan Heydon , Michael Mitzenmacher , Marc Najork : Measuring Index Quality Using Random Walks on the Web. Computer Networks 31 (11-16): 1291-1303 (1999) Jeffrey Dean , Monika Rauch Henzinger: Finding Related Pages in the World Wide Web. Computer Networks 31 (11-16): 1467-1479 (1999) Monika Rauch Henzinger, Valerie King : Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. J. ACM 46 (4): 502-516 (1999) Craig Silverstein , Monika Rauch Henzinger, Hannes Marais , Michael Moricz : Analysis of a Very Large Web Search Engine Query Log. SIGIR Forum 33 (1): 6-12 (1999) Pankaj K. Agarwal , David Eppstein , Leonidas J. Guibas , Monika Rauch Henzinger: Parametric and Kinetic Minimum Spanning Trees. FOCS 1998 : 596-605 Andrei Z. Broder , Monika Rauch Henzinger: Information Retrieval on the Web. FOCS 1998 : 6 Krishna Bharat , Monika Rauch Henzinger: Improved Algorithms for Topic Distillation in a Hyperlinked Environment. SIGIR 1998 : 104-111 Ashish Goel , Monika Rauch Henzinger, Serge A. Plotkin : Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. SODA 1998 : 97-106 David Alberts , Monika Rauch Henzinger: Average-Case Analysis of Dynamic Graph Algorithms. Algorithmica 20 (1): 31-60 (1998) Monika Rauch Henzinger, Michael L. Fredman : Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica 22 (3): 351-362 (1998) Krishna Bharat , Andrei Z. Broder , Monika Rauch Henzinger, Puneet Kumar , Suresh Venkatasubramanian : The Connectivity Server: Fast Access to Linkage Information on the Web. Computer Networks 30 (1-7): 469-477 (1998) Monika Rauch Henzinger, Valerie King : Maintaining Minimum Spanning Trees in Dynamic Graphs. ICALP 1997 : 594-604 Jennifer-Ann M. Anderson , Lance M. Berc , Jeffrey Dean , Sanjay Ghemawat , Monika Rauch Henzinger, Shun-Tak Leung , Richard L. Sites , Mark T. Vandevoorde , Carl A. Waldspurger , William E. Weihl : Continuous Profiling: Where Have All the Cycles Gone? SOSP 1997 : 1-14 Susanne Albers , Monika Rauch Henzinger: Exploring Unknown Environments. STOC 1997 : 416-425 Jennifer-Ann M. Anderson , Lance M. Berc , Jeffrey Dean , Sanjay Ghemawat , Monika Rauch Henzinger, Shun-Tak Leung , Richard L. Sites , Mark T. Vandevoorde , Carl A. Waldspurger , William E. Weihl : Continuous Profiling: Where Have All the Cycles Gone? ACM Trans. Comput. Syst. 15 (4): 357-390 (1997) Monika Rauch Henzinger: A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity. J. Algorithms 24 (1): 194-220 (1997) Monika Rauch Henzinger, Philip N. Klein , Satish Rao , Sairam Subramanian : Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. 55 (1): 3-23 (1997) Monika Rauch Henzinger, Mikkel Thorup : Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Struct. Algorithms 11 (4): 369-379 (1997) Monika Rauch Henzinger, Satish Rao , Harold N. Gabow : Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996 : 462-471 Monika Rauch Henzinger, Mikkel Thorup : Improved Sampling with Applications to Dynamic Graph Algorithms. ICALP 1996 : 290-299 Monika Rauch Henzinger, Valerie King , Tandy Warnow : Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. SODA 1996 : 333-340 Monika Rauch Henzinger, Jan Arne Telle : Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996 : 16-27 Monika Rauch Henzinger, David P. Williamson : On the Number of Small Cuts in a Graph. Inf. Process. Lett. 59 (1): 41-44 (1996) Monika Rauch Henzinger, Johannes A. La Poutré : Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. ESA 1995 : 171-184 Monika Rauch Henzinger, Thomas A. Henzinger , Peter W. Kopke : Computing Simulations on Finite and Infinite Graphs. FOCS 1995 : 453-462 Monika Rauch Henzinger, Valerie King : Fully Dynamic Biconnectivity and Transitive Closure. FOCS 1995 : 664-672 Monika Rauch Henzinger: Approximating Minimum Cuts under Insertions. ICALP 1995 : 280-291 David Alberts , Monika Rauch Henzinger: Average Case Analysis of Dynamic Graph Algorithms. SODA 1995 : 312-321 Monika Rauch Henzinger, Valerie King : Randomized dynamic graph algorithms with polylogarithmic time per operation. STOC 1995 : 519-527 Monika Rauch Henzinger: Fully Dynamic Biconnectivity in Graphs. Algorithmica 13 (6): 503-538 (1995) Monika Rauch Henzinger: Fully Dynamic Cycle-Equivalence in Graphs FOCS 1994 : 744-755 Philip N. Klein , Satish Rao , Monika Rauch Henzinger, Sairam Subramanian : Faster shortest-path algorithms for planar graphs. STOC 1994 : 27-37 1 [ 28 ] 2 [ 19 ] [ 38 ] 3 [ 5 ] [ 24 ] 4 [ 18 ] [ 20 ] 5 [ 18 ] [ 20 ] 6 [ 22 ] [ 26 ] [ 34 ] [ 39 ] [ 41 ] [ 48 ] 7 [ 53 ] 8 [ 22 ] [ 27 ] [ 34 ] [ 39 ] [ 41 ] 9 [ 48 ] [ 53 ] 10 [ 18 ] [ 20 ] [ 31 ] [ 34 ] [ 39 ] [ 41 ] 11 [ 28 ] 12 [ 23 ] 13 [ 14 ] [ 40 ] 14 [ 18 ] [ 20 ] 15 [ 25 ] [ 35 ] [ 52 ] 16 [ 28 ] 17 [ 8 ] 18 [ 32 ] [ 43 ] 19 [ 4 ] [ 7 ] [ 12 ] [ 21 ] [ 30 ] [ 33 ] [ 46 ] 20 [ 1 ] [ 16 ] 21 [ 8 ] 22 [ 22 ] 23 [ 36 ] [ 51 ] 24 [ 18 ] [ 20 ] 25 [ 29 ] 26 [ 53 ] 27 [ 32 ] [ 43 ] 28 [ 29 ] 29 [ 49 ] [ 55 ] 30 [ 32 ] [ 43 ] 31 [ 25 ] [ 35 ] [ 52 ] 32 [ 9 ] 33 [ 1 ] [ 14 ] [ 16 ] [ 40 ] 34 [ 48 ] 35 [ 29 ] [ 49 ] [ 55 ] 36 [ 18 ] [ 20 ] 37 [ 1 ] [ 16 ] 38 [ 35 ] [ 52 ] 39 [ 11 ] 40 [ 13 ] [ 15 ] 41 [ 18 ] [ 20 ] 42 [ 22 ] 43 [ 18 ] [ 20 ] 44 [ 12 ] [ 33 ] 45 [ 18 ] [ 20 ] 46 [ 10 ]  ©2005 Association for Computing Machinery |
