@article{11762,
  abstract     = {In this paper, we describe six algorithmic problems that arise in web search engines and that are not or only partially solved: (1) Uniformly sampling of web pages; (2) modeling the web graph; (3) finding duplicate hosts; (4) finding top gainers and losers in data streams; (5) finding large dense bipartite graphs; and (6) understanding how eigenvectors partition the web.},
  author       = {Henzinger, Monika H},
  issn         = {1944-9488},
  journal      = {Internet Mathematics},
  number       = {1},
  pages        = {115--123},
  publisher    = {Internet Mathematics},
  title        = {{Algorithmic challenges in web search engines}},
  doi          = {10.1080/15427951.2004.10129079},
  volume       = {1},
  year         = {2004},
}