| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Monika Rauch Henzinger 45 Krishna Bharat , Bay-Wei Chang , Monika Rauch Henzinger, Matthias Ruhl : Who Links to Whom: Mining Linkage between Web Sites. ICDM 2001 : 51-58 44 Monika Rauch Henzinger: Hyperlink Analysis for the Web. IEEE Internet Computing 5 (1): 45-50 (2001) 43 Monika Rauch Henzinger: Web Information Retrieval - an Algorithmic Perspective. ESA 2000 : 1-8 42 Monika Rauch Henzinger: Web Information Retrieval. ICDE 2000 : 693 41 Monika Rauch Henzinger: Link Analysis in Web Information Retrieval. IEEE Data Engineering Bulletin 23 (3): 3-8 (2000) 40 Krishna Bharat , Andrei Z. Broder , Jeffrey Dean , Monika Rauch Henzinger: A Comparison of Techniques to Find Mirrored Hosts on the WWW. IEEE Data Engineering Bulletin 23 (4): 21-26 (2000) 39 Monika Rauch Henzinger, Satish Rao , Harold N. Gabow : Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34 (2): 222-250 (2000) 38 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) 37 Susanne Albers , Monika Rauch Henzinger: Exploring Unknown Environments. SIAM J. Comput. 29 (4): 1164-1188 (2000) 36 Monika Rauch Henzinger: Improved Data Structures for Fully Dynamic Biconnectivity. SIAM J. Comput. 29 (6): 1761-1815 (2000) 35 Monika Rauch Henzinger, Allan Heydon , Michael Mitzenmacher , Marc Najork : On near-uniform URL sampling. WWW9 / Computer Networks 33 (1-6): 295-308 (2000) 34 Monika Rauch Henzinger, Stefano Leonardi : Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999 : 438-447 33 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 32 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) 31 Monika Rauch Henzinger, Valerie King : Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. JACM 46 (4): 502-516 (1999) 30 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) 29 Monika Rauch Henzinger, Allan Heydon , Michael Mitzenmacher , Marc Najork : Measuring Index Quality Using Random Walks on the Web. WWW8 / Computer Networks 31 (11-16): 1291-1303 (1999) 28 Jeffrey Dean , Monika Rauch Henzinger: Finding Related Pages in the World Wide Web. WWW8 / Computer Networks 31 (11-16): 1467-1479 (1999) 27 Pankaj K. Agarwal , David Eppstein , Leonidas J. Guibas , Monika Rauch Henzinger: Parametric and Kinetic Minimum Spanning Trees. FOCS 1998 : 596-605 26 Andrei Z. Broder , Monika Rauch Henzinger: Information Retrieval on the Web. FOCS 1998 : 6 25 Krishna Bharat , Monika Rauch Henzinger: Improved Algorithms for Topic Distillation in a Hyperlinked Environment. SIGIR 1998 : 104-111 24 Ashish Goel , Monika Rauch Henzinger, Serge A. Plotkin : Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. SODA 1998 : 97-106 23 David Alberts , Monika Rauch Henzinger: Average-Case Analysis of Dynamic Graph Algorithms. Algorithmica 20 (1): 31-60 (1998) 22 Monika Rauch Henzinger, Michael L. Fredman : Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica 22 (3): 351-362 (1998) 21 Krishna Bharat , Andrei Z. Broder , Monika Rauch Henzinger, Puneet Kumar , Suresh Venkatasubramanian : The Connectivity Server: Fast Access to Linkage Information on the Web. WWW7 / Computer Networks 30 (1-7): 469-477 (1998) 20 Monika Rauch Henzinger, Valerie King : Maintaining Minimum Spanning Trees in Dynamic Graphs. ICALP 1997 : 594-604 19 Jennifer-Ann M. Anderson , Lance M. Berc , Jeffrey Dean , Sanjay Ghemawat , Monika Rauch Henzinger, Shun-Tak Leung , Richard L. Sites , Mark T. Vandervoorde , Carl A. Waldspurger , William E. Weihl : Continuous Profiling: Where Have All the Cycles Gone? SOSP 1997 : 1-14 18 Susanne Albers , Monika Rauch Henzinger: Exploring Unknown Environments. STOC 1997 : 416-425 17 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) 16 Monika Rauch Henzinger, Philip N. Klein , Satish Rao , Sairam Subramanian : Faster Shortest-Path Algorithms for Planar Graphs. JCSS 55 (1): 3-23 (1997) 15 Monika Rauch Henzinger, Mikkel Thorup : Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms 11 (4): 369-379 (1997) 14 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? TOCS 15 (4): 357-390 (1997) 13 Monika Rauch Henzinger, Satish Rao , Harold N. Gabow : Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996 : 462-471 12 Monika Rauch Henzinger, Mikkel Thorup : Improved Sampling with Applications to Dynamic Graph Algorithms. ICALP 1996 : 290-299 11 Monika Rauch Henzinger, Valerie King , Tandy Warnow : Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. SODA 1996 : 333-340 10 Monika Rauch Henzinger, Jan Arne Telle : Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996 : 16-27 9 Monika Rauch Henzinger, David P. Williamson : On the Number of Small Cuts in a Graph. Information Processing Letters 59 (1): 41-44 (1996) 8 Monika Rauch Henzinger, Johannes A. La Poutré : Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. ESA 1995 : 171-184 7 Monika Rauch Henzinger, Thomas A. Henzinger , Peter W. Kopke : Computing Simulations on Finite and Infinite Graphs. FOCS 1995 : 453-462 6 Monika Rauch Henzinger, Valerie King : Fully Dynamic Biconnectivity and Transitive Closure. FOCS 1995 : 664-672 5 Monika Rauch Henzinger: Approximating Minimum Cuts under Insertions. ICALP 1995 : 280-291 4 David Alberts , Monika Rauch Henzinger: Average Case Analysis of Dynamic Graph Algorithms. SODA 1995 : 312-321 3 Monika Rauch Henzinger, Valerie King : Randomized dynamic graph algorithms with polylogarithmic time per operation. STOC 1995 : 519-527 2 Monika Rauch Henzinger: Fully Dynamic Biconnectivity in Graphs. Algorithmica 13 (6): 503-538 (1995) 1 Monika Rauch Henzinger: Fully Dynamic Cycle-Equivalence in Graphs. FOCS 1994 : 744-755  DiSC'02 © 2003 Association for Computing Machinery |
