[{"date_published":"2004-01-01T00:00:00Z","type":"journal_article","publication_identifier":{"issn":["1542-7951"],"eissn":["1944-9488"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1080/15427951.2004.10129079"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Internet Mathematics","oa_version":"Published Version","month":"01","language":[{"iso":"eng"}],"date_updated":"2023-02-10T07:47:21Z","citation":{"short":"M.H. Henzinger, Internet Mathematics 1 (2004) 115–123.","mla":"Henzinger, Monika H. “Algorithmic Challenges in Web Search Engines.” <i>Internet Mathematics</i>, vol. 1, no. 1, Internet Mathematics, 2004, pp. 115–23, doi:<a href=\"https://doi.org/10.1080/15427951.2004.10129079\">10.1080/15427951.2004.10129079</a>.","ista":"Henzinger MH. 2004. Algorithmic challenges in web search engines. Internet Mathematics. 1(1), 115–123.","ama":"Henzinger MH. Algorithmic challenges in web search engines. <i>Internet Mathematics</i>. 2004;1(1):115-123. doi:<a href=\"https://doi.org/10.1080/15427951.2004.10129079\">10.1080/15427951.2004.10129079</a>","apa":"Henzinger, M. H. (2004). Algorithmic challenges in web search engines. <i>Internet Mathematics</i>. Internet Mathematics. <a href=\"https://doi.org/10.1080/15427951.2004.10129079\">https://doi.org/10.1080/15427951.2004.10129079</a>","ieee":"M. H. Henzinger, “Algorithmic challenges in web search engines,” <i>Internet Mathematics</i>, vol. 1, no. 1. Internet Mathematics, pp. 115–123, 2004.","chicago":"Henzinger, Monika H. “Algorithmic Challenges in Web Search Engines.” <i>Internet Mathematics</i>. Internet Mathematics, 2004. <a href=\"https://doi.org/10.1080/15427951.2004.10129079\">https://doi.org/10.1080/15427951.2004.10129079</a>."},"year":"2004","doi":"10.1080/15427951.2004.10129079","day":"01","abstract":[{"lang":"eng","text":"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."}],"volume":1,"extern":"1","_id":"11762","scopus_import":"1","author":[{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"issue":"1","publication_status":"published","article_processing_charge":"No","date_created":"2022-08-08T11:55:53Z","title":"Algorithmic challenges in web search engines","intvolume":"         1","page":"115-123","quality_controlled":"1","publisher":"Internet Mathematics","article_type":"original"}]