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