Monika Rauch Henzinger

50 papers A* 20A 1Journal 26Unranked 3
YearRankTypeTitle / Venue / Authors
2008 J jnl
Theory research at Google.
SIGACT News
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
2005 J jnl
An online throughput-competitive algorithm for multicast routing and admission control.
J. Algorithms
Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
2003 J jnl
Algorithmic Challenges in Web Search Engines.
Internet Math.
Monika Rauch Henzinger
2003 A* conf
Challenges in Web Search Engines.
IJCAI
Monika Rauch Henzinger, Rajeev Motwani, Craig Silverstein
2003 J jnl
Scheduling data transfers in a network and the set scheduling problem.
J. Algorithms
Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
2003 J jnl
Scheduling multicasts on unit-capacity trees and meshes.
J. Comput. Syst. Sci.
Monika Rauch Henzinger, Stefano Leonardi
2002 J jnl
Challenges in web search engines.
SIGIR Forum
Monika Rauch Henzinger, Rajeev Motwani, Craig Silverstein
2001 J jnl
Hyperlink Analysis for the Web.
IEEE Internet Comput.
Monika Rauch Henzinger
2001 J jnl
Maintaining Minimum Spanning Forests in Dynamic Graphs.
SIAM J. Comput.
Monika Rauch Henzinger, Valerie King
2000 J jnl
A Comparison of Techniques to Find Mirrored Hosts on the WWW.
IEEE Data Eng. Bull.
Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger
2000 J jnl
A comparison of techniques to find mirrored hosts on the WWW.
J. Am. Soc. Inf. Sci.
Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger
2000 J jnl
Computing Vertex Connectivity: New Bounds from Old Techniques.
J. Algorithms
Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
2000 J jnl
Exploring Unknown Environments.
SIAM J. Comput.
Susanne Albers, Monika Rauch Henzinger
2000 J jnl
Improved Data Structures for Fully Dynamic Biconnectivity.
SIAM J. Comput.
Monika Rauch Henzinger
2000 J jnl
Link Analysis in Web Information Retrieval.
IEEE Data Eng. Bull.
Monika Rauch Henzinger
2000 J jnl
On near-uniform URL sampling.
Comput. Networks
Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork
2000 A* conf
Web Information Retrieval.
ICDE
Monika Rauch Henzinger
1999 — conf
A Comparison of Techniques to Find Mirrored Hosts on the WWW.
WOWS
Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger
1999 J jnl
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.
Algorithmica
Monika Rauch Henzinger, Valerie King, Tandy J. Warnow
1999 J jnl
Finding Related Pages in the World Wide Web.
Comput. Networks
Jeffrey Dean, Monika Rauch Henzinger
1999 J jnl
Measuring Index Quality Using Random Walks on the Web.
Comput. Networks
Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork
1999 J jnl
Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation.
J. ACM
Monika Rauch Henzinger, Valerie King
1999 A* conf
Scheduling Data Transfers in a Network and the Set Scheduling Problem.
STOC
Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
1999 A* conf
Scheduling Multicasts on Unit-Capacity Trees and Meshes.
SODA
Monika Rauch Henzinger, Stefano Leonardi
1998 J jnl
Average-Case Analysis of Dynamic Graph Algorithms.
Algorithmica
David Alberts, Monika Rauch Henzinger
1998 — conf
Computing on data streams.
External Memory Algorithms
Monika Rauch Henzinger, Prabhakar Raghavan, Sridhar Rajagopalan
1998 A* conf
Improved Algorithms for Topic Distillation in a Hyperlinked Environment.
SIGIR
Krishna Bharat, Monika Rauch Henzinger
1998 A* conf
Information Retrieval on the Web.
FOCS
Andrei Z. Broder, Monika Rauch Henzinger
1998 J jnl
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.
Algorithmica
Monika Rauch Henzinger, Michael L. Fredman
1998 A* conf
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control.
SODA
Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
1998 A* conf
Parametric and Kinetic Minimum Spanning Trees.
FOCS
Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger
1997 J jnl
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.
J. Algorithms
Monika Rauch Henzinger
1997 A* conf
Continuous Profiling: Where Have All the Cycles Gone?
SOSP
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
1997 J jnl
Continuous Profiling: Where Have All the Cycles Gone?
ACM Trans. Comput. Syst.
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
1997 A* conf
Exploring Unknown Environments.
STOC
Susanne Albers, Monika Rauch Henzinger
1997 J jnl
Faster Shortest-Path Algorithms for Planar Graphs.
J. Comput. Syst. Sci.
Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian
1997 A* conf
Maintaining Minimum Spanning Trees in Dynamic Graphs.
ICALP
Monika Rauch Henzinger, Valerie King
1997 J jnl
Sampling to provide or to bound: With applications to fully dynamic graph algorithms.
Random Struct. Algorithms
Monika Rauch Henzinger, Mikkel Thorup
1996 A* conf
Computing Vertex Connectivity: New Bounds from Old Techniques.
FOCS
Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
1996 A* conf
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.
SODA
Monika Rauch Henzinger, Valerie King, Tandy J. Warnow
1996 — conf
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.
SWAT
Monika Rauch Henzinger, Jan Arne Telle
1996 A* conf
Improved Sampling with Applications to Dynamic Graph Algorithms.
ICALP
Monika Rauch Henzinger, Mikkel Thorup
1995 A* conf
Approximating Minimum Cuts under Insertions.
ICALP
Monika Rauch Henzinger
1995 A* conf
Average Case Analysis of Dynamic Graph Algorithms.
SODA
David Alberts, Monika Rauch Henzinger
1995 A conf
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.
ESA
Monika Rauch Henzinger, Johannes A. La Poutré
1995 A* conf
Computing Simulations on Finite and Infinite Graphs.
FOCS
Monika Rauch Henzinger, Thomas A. Henzinger, Peter W. Kopke
1995 A* conf
Fully Dynamic Biconnectivity and Transitive Closure.
FOCS
Monika Rauch Henzinger, Valerie King
1995 J jnl
Fully Dynamic Biconnectivity in Graphs.
Algorithmica
Monika Rauch Henzinger
1995 A* conf
Randomized dynamic graph algorithms with polylogarithmic time per operation.
STOC
Monika Rauch Henzinger, Valerie King
1994 A* conf
Fully Dynamic Cycle-Equivalence in Graphs
FOCS
Monika Rauch Henzinger