--- title: "Taher H. Haveliwala — author profile and papers in our library" description: "Taher H. Haveliwala: 2 papers on Elamur Research (2002–2003), h-index 17 — affiliations, topics, co-authors and who cites them in our library." canonical: "https://research.elamur.ai/free/en/authors/taher-h-haveliwala/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/taher-h-haveliwala/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Taher H. Haveliwala # Taher H. Haveliwala Taher H. Haveliwala has 2 papers in our library, in 2002–2003, most of them on [Information retrieval & search](https://md.research.elamur.ai/free/en/topics/information-retrieval/). 2 papers in our library · 2002–2003 [OpenAlex](https://openalex.org/A5045119735) · [**h-index 17**](https://openalex.org/authors/A5045119735) · [36 works](https://openalex.org/works?filter=author.id:A5045119735) · [5,153 citations](https://openalex.org/works?filter=author.id:A5045119735&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/taher-h-haveliwala/#papers) · [🔗 Cited 137 times in our library](https://md.research.elamur.ai/free/en/authors/taher-h-haveliwala/cited-by/) · [7 more in our library without a page yet](#also) · [⭐ Paper Stars ranking: #1276](https://md.research.elamur.ai/free/en/paper-stars/page/13/#star-1276) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Taher+H.+Haveliwala) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Taher+H.+Haveliwala) · [dblp](https://dblp.org/search?q=Taher+H.+Haveliwala) · [ACL Anthology](https://aclanthology.org/search/?q=Taher+H.+Haveliwala) ## Affiliations [🎓**Stanford University** Stanford · United States 2000–2006 · 17 papers](https://md.research.elamur.ai/free/en/universities/stanford-university/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 2 The field of science this work belongs to (OpenAlex fields).[Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Information Systems · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/information-systems/) 🧭 Topics 1 Research subjects and languages the work is about.[Information retrieval & search · 1 work](https://md.research.elamur.ai/free/en/topics/information-retrieval/) ## Works by year ### 2000s [**2003** 1 paper](https://md.research.elamur.ai/free/en/authors/taher-h-haveliwala/year/2003/) · [**2002** 1 paper](https://md.research.elamur.ai/free/en/authors/taher-h-haveliwala/year/2002/) ## Papers The most cited first (OpenAlex and our library). 1. **[Topic-Sensitive PageRank](https://md.research.elamur.ai/free/en/papers/haveliwala-2002-topic-sensitive-pagerank/)** *(2002 · 1,624 citations)* Standard PageRank assigns every Web page one query-independent importance score. As a result, heavily linked pages can rank well for queries outside their area of authority. Haveliwala proposes making link-based importance depend on the topic while keeping query-time cost close to ordinary PageRank. Offline, the… 2. **[Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search](https://md.research.elamur.ai/free/en/papers/haveliwala-2003-topic-sensitive-pagerank-context-sensitive/)** *(2003 · 1,082 citations)* Standard PageRank gives each Web page a single importance score that ignores the query. As a result, heavily linked pages can rank highly even for topics where they have no real authority. Haveliwala addresses this by precomputing several PageRank vectors, each biased toward one topic. The bias comes from a… ## All works 9 works of theirs in our library, the most cited first; 2 with a page here, the others link their original until we summarise them. 1. **[Topic-Sensitive PageRank](https://md.research.elamur.ai/free/en/papers/haveliwala-2002-topic-sensitive-pagerank/) [International World Wide Web Conference (WWW)](https://md.research.elamur.ai/free/en/venues/international-world-wide-web-conference-www/)**Taher H. Haveliwala*2002 · 1,624 citations* 2. **[Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search](https://md.research.elamur.ai/free/en/papers/haveliwala-2003-topic-sensitive-pagerank-context-sensitive/) [IEEE Transactions on Knowledge and Data Engineering](https://md.research.elamur.ai/free/en/venues/ieee-transactions-on-knowledge-and-data-engineering/)**Taher H. Haveliwala*2003 · 1,082 citations* 3. **[Exploiting the Block Structure of the Web for Computing PageRank ↗](https://nlp.stanford.edu/pubs/blockrank.pdf) Stanford InfoLab Technical Report 2003-17 · no summary yet**Sepandar D. Kamvar et al.*2003 · 313 citations* 4. **[Evaluating strategies for similarity search on the web ↗](https://doi.org/10.1145/511446.511502) International World Wide Web Conference (WWW) · no summary yet**Taher H. Haveliwala et al.*2002 · 195 citations* 5. **[Extrapolation methods for accelerating PageRank computations ↗](https://doi.org/10.1145/775189.775190) International World Wide Web Conference (WWW) · no summary yet**Sepandar D. Kamvar et al.*2003 · 69 citations* 6. **[Computing PageRank using Power Extrapolation ↗](https://openalex.org/W193741420) no summary yet**Taher H. Haveliwala et al.*2003 · 60 citations* 7. **[Similarity Search on the Web: Evaluation and Scalability Considerations ↗](https://openalex.org/W149382220) no summary yet**Taher H. Haveliwala et al.*2001 · 9 citations* 8. **[Extrapolation Methods for Accelerating PageRank Computations ↗](https://openalex.org/W7096173664) no summary yet**Christoper D. Manning et al.*2016* 9. **[Exploiting the Block Structure of the Web for Computing ↗](https://openalex.org/W7097113269) no summary yet**Sepandar D. Kamvar et al.*2003* ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [International World Wide Web Conference (WWW)](https://md.research.elamur.ai/free/en/venues/international-world-wide-web-conference-www/) ×3: [WWW 2002](https://md.research.elamur.ai/free/en/venues/international-world-wide-web-conference-www/2002/) - [IEEE Transactions on Knowledge and Data Engineering](https://md.research.elamur.ai/free/en/venues/ieee-transactions-on-knowledge-and-data-engineering/): [IEEE Transactions on Knowledge and Data Engineering 2003](https://md.research.elamur.ai/free/en/venues/ieee-transactions-on-knowledge-and-data-engineering/2003/) - Stanford InfoLab Technical Report 2003-17 ## Cited by Papers of our library cite their works 137 times (of the 149,439 papers whose bibliographies we read); [15 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/taher-h-haveliwala/cited-by/). Updated 3 November 2026