The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Monika Rauch Henzinger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  64. A Comparison of Techniques for Sampling Web Pages. [Citation Graph (, )][DBLP]


  65. Bidder Optimal Assignments for General Utilities. [Citation Graph (, )][DBLP]


  66. Detecting the origin of text segments efficiently. [Citation Graph (, )][DBLP]


  67. Purely URL-based topic classification. [Citation Graph (, )][DBLP]


  68. The past, present, and future of web information retrieval. [Citation Graph (, )][DBLP]


  69. A Comparison of Techniques for Sampling Web Pages [Citation Graph (, )][DBLP]


  70. On the Pricing of Recommendations and Recommending Strategically [Citation Graph (, )][DBLP]


Search in 0.866secs, Finished in 0.869secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002