BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Austria
1 × Canada
1 × Finland
1 × Germany
1 × Hungary
1 × Italy
2 × France
5 × USA
Collaborated with:
V.King K.Bharat S.Albers M.Thorup E.Baykan I.Weber A.Goel S.A.Plotkin É.Tardos P.N.Klein S.Rao S.Subramanian J.M.Anderson L.M.Berc J.Dean S.Ghemawat S.Leung R.L.Sites M.T.Vandevoorde C.A.Waldspurger W.E.Weihl
Talks about:
web (6) algorithm (5) graph (4) present (3) futur (3) dynam (3) past (3) hyperlink (2) schedul (2) retriev (2)

Person: Monika Rauch Henzinger

DBLP DBLP: Henzinger:Monika_Rauch

Contributed to:

VLDB 20082008
SIGIR 20062006
Hypertext 20052005
DRR 20042004
ICALP 20042004
PODS 20042004
STOC 19991999
SIGIR 19981998
ICALP 19971997
SOSP 19971997
STOC 19971997
ICALP 19961996
ICALP 19951995
STOC 19951995
STOC 19941994

Wrote 15 papers:

VLDB-2008-BaykanHW #identification #web
Web page language identification based on URLs (EB, MRH, IW), pp. 176–187.
SIGIR-2006-Henzinger #algorithm #evaluation #scalability #web
Finding near-duplicate web pages: a large-scale evaluation of algorithms (MRH), pp. 284–291.
HT-2005-Henzinger #analysis #web
Hyperlink analysis on the world wide web (MRH), pp. 1–3.
DRR-2004-Henzinger #future of #information retrieval #past present future #web
The past, present, and future of web information retrieval (MRH), pp. 23–26.
ICALP-2004-Henzinger #future of #past present future #web
The Past, Present, and Future of Web Search Engines (MRH), p. 3.
PODS-2004-Henzinger #future of #information retrieval #past present future #web
The Past, Present and Future of Web Information Retrieval (MRH), p. 46.
STOC-1999-GoelHPT #data transfer #network #problem #scheduling #set
Scheduling Data Transfers in a Network and the Set Scheduling Problem (AG, MRH, SAP, ÉT), pp. 189–197.
SIGIR-1998-BharatH #algorithm #topic
Improved Algorithms for Topic Distillation in a Hyperlinked Environment (KB, MRH), pp. 104–111.
ICALP-1997-HenzingerK #graph #maintenance
Maintaining Minimum Spanning Trees in Dynamic Graphs (MRH, VK), pp. 594–604.
SOSP-1997-AndersonBDGHLSVWW #profiling #question
Continuous Profiling: Where Have All the Cycles Gone? (JAMA, LMB, JD, SG, MRH, STL, RLS, MTV, CAW, WEW), pp. 1–14.
Exploring Unknown Environments (SA, MRH), pp. 416–425.
ICALP-1996-HenzingerT #algorithm #graph
Improved Sampling with Applications to Dynamic Graph Algorithms (MRH, MT), pp. 290–299.
ICALP-1995-Henzinger #approximate
Approximating Minimum Cuts under Insertions (MRH), pp. 280–291.
STOC-1995-HenzingerK #algorithm #graph #random
Randomized dynamic graph algorithms with polylogarithmic time per operation (MRH, VK), pp. 519–527.
STOC-1994-KleinRRS #algorithm #graph #performance
Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.