Andrei Broder

16.9k total citations · 5 hit papers
112 papers, 10.1k citations indexed

About

Andrei Broder is a scholar working on Information Systems, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Andrei Broder has authored 112 papers receiving a total of 10.1k indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Information Systems, 40 papers in Artificial Intelligence and 39 papers in Computer Networks and Communications. Recurrent topics in Andrei Broder's work include Web Data Mining and Analysis (39 papers), Complexity and Algorithms in Graphs (19 papers) and Algorithms and Data Compression (17 papers). Andrei Broder is often cited by papers focused on Web Data Mining and Analysis (39 papers), Complexity and Algorithms in Graphs (19 papers) and Algorithms and Data Compression (17 papers). Andrei Broder collaborates with scholars based in United States, Israel and United Kingdom. Andrei Broder's co-authors include Michael Mitzenmacher, Alan Frieze, Andrew Tomkins, Janet L. Wiener, Prabhakar Raghavan, Farzin Maghoul, Mark S. Manasse, Anna R. Karlin, Ravi Kumar and Sridhar Rajagopalan and has published in prestigious journals such as Journal of the ACM, ACM SIGCOMM Computer Communication Review and SIAM Journal on Computing.

In The Last Decade

Andrei Broder

110 papers receiving 9.2k citations

Hit Papers

5 papers align trajectories

What are hit papers?

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

2000 1.7k citations Andrei Broder, Prabhakar Raghavan et al. profile →
Network Applications of Bloom Filters: A Survey

2004 1.3k citations Andrei Broder, Michael Mitzenmacher profile →
A taxonomy of web search

2002 1.2k citations Andrei Broder profile →
Syntactic clustering of the Web

1997 851 citations Andrei Broder, Mark S. Manasse et al. profile →
Min-Wise Independent Permutations

2000 537 citations Andrei Broder, Moses Charikar et al. Journal of Computer and System Sciences profile →

Peers

Countries citing papers authored by Andrei Broder

Since Specialization

Citations

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).

Fields of papers citing papers by Andrei Broder

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Learning Effective Embeddings for Machine Generated Emails with Applications to Email Category Prediction 2018 ·Yu Sun, (unknown), James B. Wendt, Marc Najork, Andrei Broder	1
2	Reviewing the Reviewers: Characterizing Biases and Competencies using Socially Meaningful Attributes. 2008 ·National Conference on Artificial Intelligence ·Sihem Amer-Yahia, Andrei Broder, Alban Galland	2
3	Proceedings of the 2008 International Conference on Web Search and Data Mining 2008 ·Marc Najork, Andrei Broder, Soumen Chakrabarti	180
4	Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers 2007 ·Springer eBooks ·William Aiello, Andrei Broder, Jeannette Janssen, Evangelos Milios	2
5	When You're Lost for Words: Faceted Search with Autocompletion 2006 ·Max Planck Institute for Plasma Physics ·Holger Bast, Ingmar Weber, Andrei Broder, Yoelle Maarek	6
6	Multidimensional balanced allocations 2005 ·Symposium on Discrete Algorithms ·Andrei Broder, Michael Mitzenmacher	3
7	The Bow-Tie web 2000 ·Andrei Broder	4
8	Min-Wise Independent Permutations breakdown → 2000 ·Journal of Computer and System Sciences ·Andrei Broder, Moses Charikar, Alan Frieze, Michael Mitzenmacher	537
9	Unscrambling address lines 1999 ·Symposium on Discrete Algorithms ·Andrei Broder, Michael Mitzenmacher, Laurent Moll	0
10	Finding anything in the billion page Web: are algorithms the key? 1999 ·Prabhakar Raghavan, Andrei Broder, Monika Henzinger, Udi Manber, (unknown)	2
11	Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). 1997 ·Andrei Broder, Alan Frieze, Eli Upfal	2
12	An efficient algorithm for the vertex-disjoint paths problem in random graphs 1996 ·Symposium on Discrete Algorithms ·Andrei Broder, Alan Frieze, Stephen Suen, Eli Upfal	8
13	On-line load balancing 1994 ·Theoretical Computer Science ·Yossi Azar, Andrei Broder, Anna R. Karlin	62
14	On-line choice of on-line algorithms 1993 ·Symposium on Discrete Algorithms ·Yossi Azar, Andrei Broder, Mark S. Manasse	12
15	On the satisfiability and maximum satisfiability of random 3-CNF formulas 1993 ·Symposium on Discrete Algorithms ·Andrei Broder, Alan Frieze, Eli Upfal	91
16	Multilevel adaptive hashing 1990 ·Symposium on Discrete Algorithms ·Andrei Broder, Anna R. Karlin	56
17	Errata to "How hard is to marry at random? (On the approximation of the permanent)". 1988 ·Andrei Broder	3
18	On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) 1987 ·Andrei Broder, Eli Shamir	5
19	A provably secure polynomial approximation scheme for the distributed lottery problem (extended abstract) 1985 ·Andrei Broder	2
20	The r-Stirling numbers 1984 ·Discrete Mathematics ·Andrei Broder	191

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.

Explore authors with similar magnitude of impact