{"scopus_import":"1","article_processing_charge":"No","type":"conference","publication_identifier":{"isbn":["9780898716245"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","title":"Combinatorial algorithms for web search engines: three success stories","date_updated":"2024-11-06T11:59:56Z","oa_version":"None","year":"2007","language":[{"iso":"eng"}],"publication":"18th Annual ACM-SIAM Symposium on Discrete Algorithms","month":"01","date_published":"2007-01-01T00:00:00Z","status":"public","conference":{"start_date":"2007-01-07","name":"SODA: Symposium on Discrete Algorithms","end_date":"2007-01-09","location":"New Orleans, LA, United States"},"publication_status":"published","page":"1022-1026","citation":{"apa":"Henzinger, M. (2007). Combinatorial algorithms for web search engines: three success stories. In <i>18th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1022–1026). New Orleans, LA, United States: Society for Industrial &#38; Applied Mathematics.","ama":"Henzinger M. Combinatorial algorithms for web search engines: three success stories. In: <i>18th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial &#38; Applied Mathematics; 2007:1022-1026.","chicago":"Henzinger, Monika. “Combinatorial Algorithms for Web Search Engines: Three Success Stories.” In <i>18th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1022–26. Society for Industrial &#38; Applied Mathematics, 2007.","ista":"Henzinger M. 2007. Combinatorial algorithms for web search engines: three success stories. 18th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1022–1026.","mla":"Henzinger, Monika. “Combinatorial Algorithms for Web Search Engines: Three Success Stories.” <i>18th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial &#38; Applied Mathematics, 2007, pp. 1022–26.","ieee":"M. Henzinger, “Combinatorial algorithms for web search engines: three success stories,” in <i>18th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2007, pp. 1022–1026.","short":"M. Henzinger, in:, 18th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial &#38; Applied Mathematics, 2007, pp. 1022–1026."},"quality_controlled":"1","author":[{"orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"}],"publisher":"Society for Industrial & Applied Mathematics","abstract":[{"lang":"eng","text":"How much can smart combinatorial algorithms improve web search engines? To address this question we will describe three algorithms that have had a positive impact on web search engines: The PageRank algorithm, algorithms for finding near-duplicate web pages, and algorithms for index server loadbalancing."}],"day":"01","_id":"11924","date_created":"2022-08-18T12:37:03Z"}