Monika Rauch Henzinger

Monika Rauch

2009
81	EE	Eda Baykan, Monika Rauch Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler: A Comparison of Techniques for Sampling Web Pages. STACS 2009: 13-30
80	EE	Eda Baykan, Monika Rauch Henzinger, Ludmila Marian, Ingmar Weber: Purely URL-based topic classification. WWW 2009: 1109-1110
79	EE	Ossama Abdel Hamid, Behshad Behzadi, Stefan Christoph, Monika Rauch Henzinger: Detecting the origin of text segments efficiently. WWW 2009: 61-70
78	EE	Eda Baykan, Monika Rauch Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler: A Comparison of Techniques for Sampling Web Pages CoRR abs/0902.1604: (2009)
2008
77	EE	Monika Rauch Henzinger: PageRank Algorithm. Encyclopedia of Algorithms 2008
76	EE	Eda Baykan, Monika Rauch Henzinger, Ingmar Weber: Web page language identification based on URLs. PVLDB 1(1): 176-187 (2008)
75	EE	Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos: Theory research at Google. SIGACT News 39(2): 10-28 (2008)
2007
74	EE	Monika Rauch Henzinger: Combinatorial algorithms for web search engines: three success stories. SODA 2007: 1022-1026
2006
73	EE	Monika Rauch Henzinger: Finding near-duplicate web pages: a large-scale evaluation of algorithms. SIGIR 2006: 284-291
2005
72	EE	Monika Rauch Henzinger: Hyperlink analysis on the world wide web. Hypertext 2005: 1-3
71	EE	Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin: An online throughput-competitive algorithm for multicast routing and admission control. J. Algorithms 55(1): 1-20 (2005)
70	EE	Monika Rauch Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin: Query-Free News Search. World Wide Web 8(2): 101-126 (2005)
2004
69	EE	Monika Rauch Henzinger: The past, present, and future of web information retrieval. DRR 2004: 23-26
68	EE	Monika Rauch Henzinger: Algorithmic Aspects of Web Search Engines. ESA 2004: 3
67	EE	Monika Rauch Henzinger: The Past, Present, and Future of Web Search Engines p. ICALP 2004: 3
66	EE	Monika Rauch Henzinger: The Past, Present and Future of Web Information Retrieval. PODS 2004: 46
2003
65		Monika Rauch Henzinger, Rajeev Motwani, Craig Silverstein: Challenges in Web Search Engines. IJCAI 2003: 1573-1579
64		Monika Rauch Henzinger: The Past, Present and Future of Web Information Retrieval. INFOS 2003: 57-57
63	EE	Monika Rauch Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin: Query-free news search. WWW 2003: 1-10
62		Monika Rauch Henzinger: Algorithmic Challenges in Web Search Engines. Internet Mathematics 1(1): (2003)
61	EE	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)
60	EE	Monika Rauch Henzinger, Stefano Leonardi: Scheduling multicasts on unit-capacity trees and meshes. J. Comput. Syst. Sci. 66(3): 567-611 (2003)
2002
59	EE	Monika Rauch Henzinger: Indexing the Web - A Challenge for Supercomputers. CLUSTER 2002: 343-343
58	EE	Monika Rauch Henzinger, Rajeev Motwani, Craig Silverstein: Challenges in web search engines. SIGIR Forum 36(2): 11-22 (2002)
2001
57	EE	Krishna Bharat, Bay-Wei Chang, Monika Rauch Henzinger, Matthias Ruhl: Who Links to Whom: Mining Linkage between Web Sites. ICDM 2001: 51-58
56	EE	Monika Rauch Henzinger: Hyperlink Analysis for the Web. IEEE Internet Computing 5(1): 45-50 (2001)
55	EE	Monika Rauch Henzinger, Valerie King: Maintaining Minimum Spanning Forests in Dynamic Graphs. SIAM J. Comput. 31(2): 364-374 (2001)
2000
54		Monika Rauch Henzinger: Web Information Retrieval - an Algorithmic Perspective. ESA 2000: 1-8
53	EE	Monika Rauch Henzinger: Web Information Retrieval. ICDE 2000: 693
52	EE	Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork: On near-uniform URL sampling. Computer Networks 33(1-6): 295-308 (2000)
51	EE	Monika Rauch Henzinger: Link Analysis in Web Information Retrieval. IEEE Data Eng. Bull. 23(3): 3-8 (2000)
50	EE	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)
49		Monika Rauch Henzinger, Satish Rao, Harold N. Gabow: Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34(2): 222-250 (2000)
48		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)
47		Susanne Albers, Monika Rauch Henzinger: Exploring Unknown Environments. SIAM J. Comput. 29(4): 1164-1188 (2000)
46		Monika Rauch Henzinger: Improved Data Structures for Fully Dynamic Biconnectivity. SIAM J. Comput. 29(6): 1761-1815 (2000)
1999
45	EE	Monika Rauch Henzinger, Stefano Leonardi: Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999: 438-447
44	EE	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
43		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
42	EE	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)
41	EE	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)
40	EE	Jeffrey Dean, Monika Rauch Henzinger: Finding Related Pages in the World Wide Web. Computer Networks 31(11-16): 1467-1479 (1999)
39	EE	Monika Rauch Henzinger, Valerie King: Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. J. ACM 46(4): 502-516 (1999)
38	EE	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)
1998
37	EE	Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger: Parametric and Kinetic Minimum Spanning Trees. FOCS 1998: 596-605
36	EE	Andrei Z. Broder, Monika Rauch Henzinger: Information Retrieval on the Web. FOCS 1998: 6
35	EE	Krishna Bharat, Monika Rauch Henzinger: Improved Algorithms for Topic Distillation in a Hyperlinked Environment. SIGIR 1998: 104-111
34		Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin: Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. SODA 1998: 97-106
33		David Alberts, Monika Rauch Henzinger: Average-Case Analysis of Dynamic Graph Algorithms. Algorithmica 20(1): 31-60 (1998)
32	EE	Monika Rauch Henzinger, Michael L. Fredman: Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica 22(3): 351-362 (1998)
31	EE	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)
1997
30		Monika Rauch Henzinger, Valerie King: Maintaining Minimum Spanning Trees in Dynamic Graphs. ICALP 1997: 594-604
29		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
28	EE	Susanne Albers, Monika Rauch Henzinger: Exploring Unknown Environments. STOC 1997: 416-425
27	EE	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)
26		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)
25		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)
24		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)
1996
23		Monika Rauch Henzinger, Satish Rao, Harold N. Gabow: Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996: 462-471
22		Monika Rauch Henzinger, Mikkel Thorup: Improved Sampling with Applications to Dynamic Graph Algorithms. ICALP 1996: 290-299
21		Monika Rauch Henzinger, Valerie King, Tandy Warnow: Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. SODA 1996: 333-340
20		Monika Rauch Henzinger, Jan Arne Telle: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996: 16-27
19	EE	Monika Rauch Henzinger, David P. Williamson: On the Number of Small Cuts in a Graph. Inf. Process. Lett. 59(1): 41-44 (1996)
1995
18		Monika Rauch Henzinger, Johannes A. La Poutré: Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. ESA 1995: 171-184
17		Monika Rauch Henzinger, Thomas A. Henzinger, Peter W. Kopke: Computing Simulations on Finite and Infinite Graphs. FOCS 1995: 453-462
16		Monika Rauch Henzinger, Valerie King: Fully Dynamic Biconnectivity and Transitive Closure. FOCS 1995: 664-672
15		Monika Rauch Henzinger: Approximating Minimum Cuts under Insertions. ICALP 1995: 280-291
14		David Alberts, Monika Rauch Henzinger: Average Case Analysis of Dynamic Graph Algorithms. SODA 1995: 312-321
13	EE	Monika Rauch Henzinger, Valerie King: Randomized dynamic graph algorithms with polylogarithmic time per operation. STOC 1995: 519-527
12		Monika Rauch Henzinger: Fully Dynamic Biconnectivity in Graphs. Algorithmica 13(6): 503-538 (1995)
1994
11		Monika Rauch Henzinger: Fully Dynamic Cycle-Equivalence in Graphs FOCS 1994: 744-755
10	EE	Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian: Faster shortest-path algorithms for planar graphs. STOC 1994: 27-37
9	EE	Monika Rauch: Improved data structures for fully dynamic biconnectivity. STOC 1994: 686-695
8		John Hershberger, Monika Rauch, Subhash Suri: Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. 130(1): 139-161 (1994)
1993
7		Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch: Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). ESA 1993: 212-223
6		Bruce M. Maggs, Monika Rauch: An Algorithm for Finding Predecessors in Integer Sets. WADS 1993: 483-493
1992
5		Monika Rauch: Fully Dynamic Biconnectivity in Graphs FOCS 1992: 50-59
4		John Hershberger, Monika Rauch, Subhash Suri: Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992: 233-244
3		Brandon Dixon, Monika Rauch, Robert Endre Tarjan: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM J. Comput. 21(6): 1184-1192 (1992)
1990
2		Kurt Mehlhorn, Stefan Näher, Monika Rauch: On the Complexity of a Game Related to the Dictionary Problem. SIAM J. Comput. 19(5): 902-906 (1990)
1989
1		Kurt Mehlhorn, Stefan Näher, Monika Rauch: On the Complexity of a Game Related to the Dictionary Problem FOCS 1989: 546-548

Coauthor Index

1	Pankaj K. Agarwal	[37]
2	Gagan Aggarwal	[75]
3	Nir Ailon	[75]
4	Susanne Albers	[28] [47]
5	David Alberts	[14] [33]
6	Jennifer-Ann M. Anderson	[27] [29]
7	Eda Baykan	[76] [78] [80] [81]
8	Behshad Behzadi	[79]
9	Lance M. Berc	[27] [29]
10	Krishna Bharat	[31] [35] [43] [48] [50] [57]
11	Sergey Brin	[63] [70]
12	Andrei Z. Broder	[31] [36] [43] [48] [50]
13	Sebastian De Castelberg	[78] [81]
14	Bay-Wei Chang	[57] [63] [70]
15	Stefan Christoph	[79]
16	Florin Constantin	[75]
17	Jeffrey Dean	[27] [29] [40] [43] [48] [50]
18	Brandon Dixon	[3]
19	David Eppstein	[37]
20	Eyal Even-Dar	[75]
21	Jon Feldman	[75]
22	Gereon Frahling	[75]
23	Michael L. Fredman	[32]
24	Harold N. Gabow	[23] [49]
25	Sanjay Ghemawat	[27] [29]
26	Ashish Goel	[34] [44] [61] [71]
27	Leonidas J. Guibas	[37]
28	Ossama Abdel Hamid	[79]
29	Thomas A. Henzinger	[17]
30	John Hershberger	[4] [8]
31	Allan Heydon	[41] [52]
32	Giuseppe F. Italiano	[7]
33	Stefan F. Keller	[78] [81]
34	Valerie King	[13] [16] [21] [30] [39] [42] [55]
35	Markus Kinzler	[78] [81]
36	Philip N. Klein	[10] [25]
37	Peter W. Kopke	[17]
38	Puneet Kumar	[31]
39	Stefano Leonardi	[45] [60]
40	Shun-Tak Leung	[27] [29]
41	Bruce M. Maggs	[6]
42	Hannes Marais	[38]
43	Ludmila Marian	[80]
44	Kurt Mehlhorn	[1] [2]
45	Brian Milch	[63] [70]
46	Michael Mitzenmacher	[41] [52]
47	Michael Moricz	[38]
48	Rajeev Motwani	[58] [65]
49	S. Muthukrishnan (S. Muthu Muthukrishnan)	[75]
50	Stefan Näher	[1] [2]
51	Marc Najork	[41] [52]
52	Noam Nisan	[75]
53	Martin Pál (Martin Pal)	[75]
54	Serge A. Plotkin	[34] [44] [61] [71]
55	Johannes A. La Poutré (Han La Poutré)	[7] [18]
56	Satish Rao	[10] [23] [25] [49]
57	Matthias Ruhl	[57]
58	Mark Sandler	[75]
59	Anastasios Sidiropoulos	[75]
60	Craig Silverstein	[38] [58] [65]
61	Richard L. Sites	[27] [29]
62	Sairam Subramanian	[10] [25]
63	Subhash Suri	[4] [8]
64	Éva Tardos	[44] [61]
65	Robert Endre Tarjan	[3]
66	Jan Arne Telle	[20]
67	Mikkel Thorup	[22] [24]
68	Mark T. Vandevoorde	[27] [29]
69	Suresh Venkatasubramanian	[31]
70	Carl A. Waldspurger	[27] [29]
71	Tandy Warnow	[21] [42]
72	Ingmar Weber	[76] [80]
73	William E. Weihl	[27] [29]
74	David P. Williamson	[19]

Colors in the list of coauthors