Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Graph structure in the Web
20001.7k citationsAndrei Broder, Prabhakar Raghavan et al.profile →
Network Applications of Bloom Filters: A Survey
20041.3k citationsAndrei Broder, Michael Mitzenmacherprofile →
This map shows the geographic impact of Andrei Broder's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrei Broder with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrei Broder more than expected).
This network shows the impact of papers produced by Andrei Broder. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrei Broder. The network helps show where Andrei Broder may publish in the future.
Co-authorship network of co-authors of Andrei Broder
This figure shows the co-authorship network connecting the top 25 collaborators of Andrei Broder.
A scholar is included among the top collaborators of Andrei Broder based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Andrei Broder. Andrei Broder is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Amer-Yahia, Sihem, Andrei Broder, & Alban Galland. (2008). Reviewing the Reviewers: Characterizing Biases and Competencies using Socially Meaningful Attributes.. National Conference on Artificial Intelligence. 1–6.2 indexed citations
2.
Najork, Marc, Andrei Broder, & Soumen Chakrabarti. (2008). Proceedings of the 2008 International Conference on Web Search and Data Mining.180 indexed citations
3.
Aiello, William, Andrei Broder, Jeannette Janssen, & Evangelos Milios. (2007). Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers. Springer eBooks.2 indexed citations
4.
Bast, Holger, Ingmar Weber, Andrei Broder, & Yoelle Maarek. (2006). When You're Lost for Words: Faceted Search with Autocompletion. Max Planck Institute for Plasma Physics. 31–35.6 indexed citations
Broder, Andrei. (2000). The Bow-Tie web.4 indexed citations
8.
Broder, Andrei, Moses Charikar, Alan Frieze, & Michael Mitzenmacher. (2000). Min-Wise Independent Permutations. Journal of Computer and System Sciences. 60(3). 630–659.537 indexed citations breakdown →
9.
Broder, Andrei, Michael Mitzenmacher, & Laurent Moll. (1999). Unscrambling address lines. Symposium on Discrete Algorithms. 870–871.
10.
Raghavan, Prabhakar, et al.. (1999). Finding anything in the billion page Web: are algorithms the key?. 31. 1760–1761.2 indexed citations
11.
Broder, Andrei, Alan Frieze, & Eli Upfal. (1997). Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version).. 531–539.2 indexed citations
Azar, Yossi, Andrei Broder, & Anna R. Karlin. (1994). On-line load balancing. Theoretical Computer Science. 130(1). 73–84.62 indexed citations
14.
Azar, Yossi, Andrei Broder, & Mark S. Manasse. (1993). On-line choice of on-line algorithms. Symposium on Discrete Algorithms. 432–440.12 indexed citations
Broder, Andrei & Anna R. Karlin. (1990). Multilevel adaptive hashing. Symposium on Discrete Algorithms. 43–53.56 indexed citations
17.
Broder, Andrei. (1988). Errata to "How hard is to marry at random? (On the approximation of the permanent)".. 551.3 indexed citations
18.
Broder, Andrei & Eli Shamir. (1987). On the Second Eigenvalue of Random Regular Graphs (Preliminary Version). 286–294.5 indexed citations
19.
Broder, Andrei, Danny Dolev, Michael J. Fischer, & Barbara Sımons. (1987). Efficient fault-tolerant routings in networks. Information and Computation. 75(1). 52–64.12 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.