[{"publisher":"Society for Industrial & Applied Mathematics","date_published":"2007-01-01T00:00:00Z","page":"1022-1026","date_created":"2022-08-18T12:37:03Z","month":"01","conference":{"start_date":"2007-01-07","location":"New Orleans, LA, United States","name":"SODA: Symposium on Discrete Algorithms","end_date":"2007-01-09"},"status":"public","publication_identifier":{"isbn":["9780898716245"]},"scopus_import":"1","type":"conference","date_updated":"2023-02-17T12:06:29Z","oa_version":"None","day":"01","year":"2007","citation":{"short":"M.H. Henzinger, in:, 18th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial &#38; Applied Mathematics, 2007, pp. 1022–1026.","chicago":"Henzinger, Monika H. “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 MH. 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.","ama":"Henzinger MH. 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.","ieee":"M. H. 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.","apa":"Henzinger, M. H. (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.","mla":"Henzinger, Monika H. “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."},"author":[{"last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"}],"article_processing_charge":"No","quality_controlled":"1","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"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.","lang":"eng"}],"title":"Combinatorial algorithms for web search engines: three success stories","publication":"18th Annual ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"_id":"11924"}]