Monika Rauch Henzinger

Monika Henzinger, Monika Rauch

	2013
j42		Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah: Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design 42(3): 301-327 (2013)
j41		Luca Aceto, Monika Henzinger, Jiri Sgall: 38th International Colloquium on Automata, Languages and Programming. Inf. Comput. 222: 1 (2013)
j40		Paul Dütting, Monika Henzinger, Ingmar Weber: Sponsored search, market equilibria, and the Hungarian Method. Inf. Process. Lett. 113(3): 67-73 (2013)
j39		Paul Dütting, Monika Henzinger, Ingmar Weber: Bidder optimal assignments for general utilities. Theor. Comput. Sci. 478: 22-32 (2013)
j38		Eda Baykan, Monika Henzinger, Ingmar Weber: A Comprehensive Study of Techniques for URL-Based Web Page Language Classification. TWEB 7(1): 3 (2013)
	2012
c59		Paul Dütting, Monika Henzinger, Ingmar Weber: Maximizing revenue from strategic recommendations under decaying trust. CIKM 2012: 2283-2286
c58		Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai: Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA 2012: 301-312
c57		Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger: On Multiple Keyword Sponsored Search Auctions with Budgets. ICALP (2) 2012: 1-12
c56		Krishnendu Chatterjee, Monika Henzinger: An O(n2) time algorithm for alternating Büchi games. SODA 2012: 1386-1399
c55		Paul Dütting, Monika Henzinger, Martin Starnberger: Auctions with Heterogeneous Items and Budget Limits. WINE 2012: 44-57
i8		Paul Dütting, Monika Henzinger, Martin Starnberger: Auctions with Heterogeneous Items and Budget Limits. CoRR abs/1209.6448 (2012)
	2011
j37		Paul Dütting, Monika Henzinger, Ingmar Weber: Offline file assignments for online load balancing. Inf. Process. Lett. 111(4): 178-183 (2011)
j36		Eda Baykan, Monika Henzinger, Ludmila Marian, Ingmar Weber: A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification. TWEB 5(3): 15 (2011)
c54		Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah: Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. CAV 2011: 260-276
c53		Monika Henzinger, Angelina Vidali: Multi-parameter Mechanism Design under Budget and Matroid Constraints. ESA 2011: 192-202
c52		Krishnendu Chatterjee, Monika Henzinger: Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SODA 2011: 1318-1336
c51		Paul Dütting, Monika Henzinger, Ingmar Weber: An expressive mechanism for auctions on the web. WWW 2011: 127-136
e2		Luca Aceto, Monika Henzinger, Jiri Sgall (Eds.): Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I. Lecture Notes in Computer Science 6755, Springer 2011, isbn 978-3-642-22005-0
e1		Luca Aceto, Monika Henzinger, Jiri Sgall (Eds.): Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II. Lecture Notes in Computer Science 6756, Springer 2011, isbn 978-3-642-22011-1
i7		Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah: Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. CoRR abs/1104.3348 (2011)
i6		Krishnendu Chatterjee, Monika Henzinger: An O(n^2) Time Algorithm for Alternating Büchi Games. CoRR abs/1109.5018 (2011)
i5		Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger: On Multiple Round Sponsored Search Auctions with Budgets. CoRR abs/1112.6361 (2011)
	2010
j35		Monika Henzinger, Jacob Suñol, Ingmar Weber: The stability of the h-index. Scientometrics 84(2): 465-479 (2010)
c50		Paul Dütting, Monika Henzinger: Mechanisms for the Marriage and the Assignment Game. CIAC 2010: 6-12
c49		Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein: Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194
c48		Paul Dütting, Monika Henzinger, Ingmar Weber: Sponsored Search, Market Equilibria, and the Hungarian Method. STACS 2010: 287-298
c47		Paul Dütting, Monika Henzinger, Ingmar Weber: How much is your personal recommendation worth? WWW 2010: 1085-1086
i4		Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein: Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010)
	2009
c46		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
c45		Paul Dütting, Monika Rauch Henzinger, Ingmar Weber: Bidder Optimal Assignments for General Utilities. WINE 2009: 575-582
c44		Ossama Abdel Hamid, Behshad Behzadi, Stefan Christoph, Monika Rauch Henzinger: Detecting the origin of text segments efficiently. WWW 2009: 61-70
c43		Eda Baykan, Monika Rauch Henzinger, Ludmila Marian, Ingmar Weber: Purely URL-based topic classification. WWW 2009: 1109-1110
i3		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)
i2		Paul Dütting, Monika Rauch Henzinger, Ingmar Weber: On the Pricing of Recommendations and Recommending Strategically. CoRR abs/0911.1619 (2009)
i1		Paul Dütting, Monika Henzinger, Ingmar Weber: Sponsored Search, Market Equilibria, and the Hungarian Method. CoRR abs/0912.1934 (2009)
	2008
j34		Eda Baykan, Monika Rauch Henzinger, Ingmar Weber: Web page language identification based on URLs. PVLDB 1(1): 176-187 (2008)
j33		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)
r1		Monika Rauch Henzinger: PageRank Algorithm. Encyclopedia of Algorithms 2008
	2007
c42		Monika Rauch Henzinger: Combinatorial algorithms for web search engines: three success stories. SODA 2007: 1022-1026
	2006
c41		Monika Rauch Henzinger: Finding near-duplicate web pages: a large-scale evaluation of algorithms. SIGIR 2006: 284-291
	2005
j32		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)
j31		Monika Rauch Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin: Query-Free News Search. World Wide Web 8(2): 101-126 (2005)
c40		Monika Rauch Henzinger: Hyperlink analysis on the world wide web. Hypertext 2005: 1-3
	2004
c39		Monika Rauch Henzinger: The past, present, and future of web information retrieval. DRR 2004: 23-26
c38		Monika Rauch Henzinger: Algorithmic Aspects of Web Search Engines. ESA 2004: 3
c37		Monika Rauch Henzinger: The Past, Present, and Future of Web Search Engines p. ICALP 2004: 3
c36		Monika Rauch Henzinger: The Past, Present and Future of Web Information Retrieval. PODS 2004: 46
	2003
j30		Monika Rauch Henzinger: Algorithmic Challenges in Web Search Engines. Internet Mathematics 1(1): 115-123 (2003)
j29		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)
j28		Monika Rauch Henzinger, Stefano Leonardi: Scheduling multicasts on unit-capacity trees and meshes. J. Comput. Syst. Sci. 66(3): 567-611 (2003)
c35		Monika Rauch Henzinger, Rajeev Motwani, Craig Silverstein: Challenges in Web Search Engines. IJCAI 2003: 1573-1579
c34		Monika Rauch Henzinger: The Past, Present and Future of Web Information Retrieval. INFOS 2003: 57
c33		Monika Rauch Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin: Query-free news search. WWW 2003: 1-10
	2002
j27		Monika Rauch Henzinger, Rajeev Motwani, Craig Silverstein: Challenges in web search engines. SIGIR Forum 36(2): 11-22 (2002)
c32		Monika Rauch Henzinger: Indexing the Web - A Challenge for Supercomputers. CLUSTER 2002: 343-343
	2001
j26		Monika Rauch Henzinger: Hyperlink Analysis for the Web. IEEE Internet Computing 5(1): 45-50 (2001)
j25		Monika Rauch Henzinger, Valerie King: Maintaining Minimum Spanning Forests in Dynamic Graphs. SIAM J. Comput. 31(2): 364-374 (2001)
c31		Krishna Bharat, Bay-Wei Chang, Monika Rauch Henzinger, Matthias Ruhl: Who Links to Whom: Mining Linkage between Web Sites. ICDM 2001: 51-58
	2000
j24		Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork: On near-uniform URL sampling. Computer Networks 33(1-6): 295-308 (2000)
j23		Monika Rauch Henzinger: Link Analysis in Web Information Retrieval. IEEE Data Eng. Bull. 23(3): 3-8 (2000)
j22		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)
j21		Monika Rauch Henzinger, Satish Rao, Harold N. Gabow: Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34(2): 222-250 (2000)
j20		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)
j19		Susanne Albers, Monika Rauch Henzinger: Exploring Unknown Environments. SIAM J. Comput. 29(4): 1164-1188 (2000)
j18		Monika Rauch Henzinger: Improved Data Structures for Fully Dynamic Biconnectivity. SIAM J. Comput. 29(6): 1761-1815 (2000)
c30		Monika Rauch Henzinger: Web Information Retrieval - an Algorithmic Perspective. ESA 2000: 1-8
c29		Monika Rauch Henzinger: Web Information Retrieval. ICDE 2000: 693
	1999
j17		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)
j16		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)
j15		Jeffrey Dean, Monika Rauch Henzinger: Finding Related Pages in the World Wide Web. Computer Networks 31(11-16): 1467-1479 (1999)
j14		Monika Rauch Henzinger, Valerie King: Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. J. ACM 46(4): 502-516 (1999)
j13		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)
c28		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
c27		Monika Rauch Henzinger, Stefano Leonardi: Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999: 438-447
c26		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
	1998
j12		David Alberts, Monika Rauch Henzinger: Average-Case Analysis of Dynamic Graph Algorithms. Algorithmica 20(1): 31-60 (1998)
j11		Monika Rauch Henzinger, Michael L. Fredman: Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica 22(3): 351-362 (1998)
j10		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)
c25		Andrei Z. Broder, Monika Rauch Henzinger: Information Retrieval on the Web. FOCS 1998: 6
c24		Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger: Parametric and Kinetic Minimum Spanning Trees. FOCS 1998: 596-605
c23		Krishna Bharat, Monika Rauch Henzinger: Improved Algorithms for Topic Distillation in a Hyperlinked Environment. SIGIR 1998: 104-111
c22		Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin: Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. SODA 1998: 97-106
	1997
j9		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)
j8		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)
j7		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)
j6		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)
c21		Monika Rauch Henzinger, Valerie King: Maintaining Minimum Spanning Trees in Dynamic Graphs. ICALP 1997: 594-604
c20		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
c19		Susanne Albers, Monika Rauch Henzinger: Exploring Unknown Environments. STOC 1997: 416-425
	1996
j5		Monika Rauch Henzinger, David P. Williamson: On the Number of Small Cuts in a Graph. Inf. Process. Lett. 59(1): 41-44 (1996)
c18		Monika Rauch Henzinger, Satish Rao, Harold N. Gabow: Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996: 462-471
c17		Monika Rauch Henzinger, Mikkel Thorup: Improved Sampling with Applications to Dynamic Graph Algorithms. ICALP 1996: 290-299
c16		Monika Rauch Henzinger, Valerie King, Tandy Warnow: Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. SODA 1996: 333-340
c15		Monika Rauch Henzinger, Jan Arne Telle: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996: 16-27
	1995
j4		Monika Rauch Henzinger: Fully Dynamic Biconnectivity in Graphs. Algorithmica 13(6): 503-538 (1995)
c14		Monika Rauch Henzinger, Johannes A. La Poutré: Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. ESA 1995: 171-184
c13		Monika Rauch Henzinger, Thomas A. Henzinger, Peter W. Kopke: Computing Simulations on Finite and Infinite Graphs. FOCS 1995: 453-462
c12		Monika Rauch Henzinger, Valerie King: Fully Dynamic Biconnectivity and Transitive Closure. FOCS 1995: 664-672
c11		Monika Rauch Henzinger: Approximating Minimum Cuts under Insertions. ICALP 1995: 280-291
c10		David Alberts, Monika Rauch Henzinger: Average Case Analysis of Dynamic Graph Algorithms. SODA 1995: 312-321
c9		Monika Rauch Henzinger, Valerie King: Randomized dynamic graph algorithms with polylogarithmic time per operation. STOC 1995: 519-527
	1994
j3		John Hershberger, Monika Rauch, Subhash Suri: Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. 130(1): 139-161 (1994)
c8		Monika Rauch Henzinger: Fully Dynamic Cycle-Equivalence in Graphs. FOCS 1994: 744-755
c7		Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian: Faster shortest-path algorithms for planar graphs. STOC 1994: 27-37
c6		Monika Rauch: Improved data structures for fully dynamic biconnectivity. STOC 1994: 686-695
	1993
c5		Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch: Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). ESA 1993: 212-223
c4		Bruce M. Maggs, Monika Rauch: An Algorithm for Finding Predecessors in Integer Sets. WADS 1993: 483-493
	1992
j2		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)
c3		Monika Rauch: Fully Dynamic Biconnectivity in Graphs. FOCS 1992: 50-59
c2		John Hershberger, Monika Rauch, Subhash Suri: Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992: 233-244
	1990
j1		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
c1		Kurt Mehlhorn, Stefan Näher, Monika Rauch: On the Complexity of a Game Related to the Dictionary Problem. FOCS 1989: 546-548

Coauthor Index

Colors in the list of coauthors

Last update Wed May 22 20:21:46 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page