Andrei Broder | Academic Influence

Andrei Broder's AcademicInfluence.com Rankings

Andrei Broder

Computer Science

#1084

World Rank

#1123

Historical Rank

Algorithms

#20

World Rank

#20

Historical Rank

Database

#2345

World Rank

#2460

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Andrei Broder's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Andrei Broder Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Andrei Zary Broder is a distinguished scientist at Google. Previously, he was a research fellow and vice president of computational advertising for Yahoo!, and before that, the vice president of research for AltaVista. He has also worked for IBM Research as a distinguished engineer and was CTO of IBM's Institute for Search and Text Analysis.

(See a Problem?)

Andrei Broder's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Graph structure in the Web (2000) (2984)
Summary cache: a scalable wide-area web cache sharing protocol (2000) (2249)
Network Applications of Bloom Filters: A Survey (2004) (2241)
A taxonomy of web search (2002) (2205)
On the resemblance and containment of documents (1997) (1924)
Syntactic Clustering of the Web (1997) (1544)
Min-Wise Independent Permutations (2000) (895)
Balanced Allocations (1999) (768)
A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines (1998) (458)
Identifying and Filtering Near-Duplicate Documents (2000) (427)
Efficient query evaluation using a two-level retrieval process (2003) (417)
Generating random spanning trees (1989) (397)
A semantic approach to contextual advertising (2007) (352)
Min-wise independent permutations (extended abstract) (1998) (333)
The r-Stirling numbers (1984) (333)
Margin Based Active Learning (2007) (318)
On the second eigenvalue of random regular graphs (1987) (267)
Using multiple hash functions to improve IP lookups (2001) (258)
On-line load balancing (1992) (254)
Some applications of Rabin’s fingerprinting method (1993) (238)
The Connectivity Server: Fast Access to Linkage Information on the Web (1998) (229)
Robust classification of rare queries using web knowledge (2007) (209)
Workshop on Algorithms and Models for the Web Graph (2007) (199)
Anatomy of the long tail: ordinary people with extraordinary tastes (2010) (181)
How hard is it to marry at random? (On the approximation of the permanent) (1986) (176)
On the satisfiability and maximum satisfiability of random 3-CNF formulas (1993) (164)
Sic transit gloria telae: towards an understanding of the web's decay (2004) (154)
Summary cache: a scalable wide-area Web cache sharing protocol (1998) (149)
Efficient PageRank approximation via graph aggregation (2004) (129)
Mirror, Mirror on the Web: A Study of Host Pairs with Replicated Content (1999) (128)
Bounds on the cover time (1988) (127)
Balanced allocations (extended abstract) (1994) (116)
Online expansion of rare queries for sponsored search (2009) (116)
Optimizing relevance and revenue in ad search: a query substitution approach (2008) (110)
A Comparison of Techniques to Find Mirrored Hosts on the WWW (2000) (109)
Search advertising using web relevance feedback (2008) (100)
Multilevel adaptive hashing (1990) (95)
Trading space for time in undirected s-t connectivity (1989) (88)
Sampling Search-Engine Results (2005) (86)
Efficient URL caching for world wide web crawling (2003) (86)
Just-in-time contextual advertising (2007) (84)
Optimal construction of edge-disjoint paths in random graphs (1994) (78)
Nearest-neighbor caching for content-match applications (2009) (74)
Estimating corpus size via queries (2006) (66)
Existence and Construction of Edge-Disjoint Paths on Expander Graphs (1994) (65)
Biased random walks (1992) (65)
To swing or not to swing: learning when (not) to advertise (2008) (62)
Automatic generation of bid phrases for online advertising (2010) (59)
Computational advertising and recommender systems (2008) (56)
Web Scraping (2009) (55)
Classifying search queries using the Web as a source of knowledge (2009) (55)
Existence and construction of edge disjoint paths on expander graphs (1992) (54)
Scalable K-Means by ranked retrieval (2014) (51)
Estimating rates of rare events at multiple resolutions (2007) (51)
Indexing Shared Content in Information Retrieval Systems (2006) (49)
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (1999) (47)
The hiring problem and Lake Wobegon strategies (2008) (44)
Competing for users' attention: on the interplay between organic and sponsored search results (2010) (43)
Towards the next generation of enterprise search technology (2004) (41)
A general approach to dynamic packet routing with bounded buffers (1996) (39)
Finding hidden Hamiltonian cycles (1991) (39)
Effective and efficient classification on a search-engine model (2006) (37)
Flipping coins in many pockets (Byzantine agreement on uniformly random values) (1984) (34)
A derandomization using min-wise independent permutations (1998) (33)
Counting Minimum Weight Spanning Trees (1997) (29)
On-line choice of on-line algorithms (1993) (28)
Efficient fault tolerant routings in networks (1984) (28)
On Generating Solved Instances of Computational Problems (1988) (27)
An efficient algorithm for the vertex-disjoint paths problem in random graphs (1996) (26)
What happens after an ad click?: quantifying the impact of landing pages in web advertising (2009) (25)
Computational advertising (2008) (25)
A Note on Double Pooling Tests (2020) (24)
Dynamic deflection routing on arrays (preliminary version) (1996) (23)
Proceedings of the 23rd International Conference on World Wide Web (2014) (23)
Efficient Fault-Tolerant Routings in Networks (1987) (23)
Bid generation for advanced match in sponsored search (2011) (21)
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height (1995) (20)
Web Advertising (2009) (19)
Exploiting site-level information to improve web search (2010) (18)
The New Frontier of Web Search Technology: Seven Challenges (2010) (18)
When You're Lost for Words: Faceted Search with Autocompletion (2006) (18)
Near-perfect Token Distribution (1992) (17)
Web Page Summarization for Just-in-Time Contextual Advertising (2011) (15)
Improved classification via connectivity information (2000) (15)
Min-wise Independent Permutations: Theory and Practice (2000) (15)
A search-based method for forecasting ad impression in contextual advertising (2009) (14)
Social Media Analysis (2017) (13)
Algorithmic aspects of information retrieval on the web (2002) (12)
Context transfer in search advertising (2009) (12)
On the Problem of Approximating the Number of Bases of a Matroid (1994) (12)
Optimal plans for aggregation (2002) (11)
Introduction to special issue on query log analysis: Technology and ethics (2008) (11)
Email Category Prediction (2017) (10)
Cross-language query classification using web search for exogenous knowledge (2009) (10)
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach (1997) (10)
On the performance of edited nearest neighbor rules in high dimensions (1985) (10)
A GENERAL EXPRESSION FOR ABELIAN IDENTITIES (1983) (9)
Two counting problems solved via string encodings (1985) (9)
On the parallel complexity of evaluating game trees (1991) (9)
Social Influence Based Clustering of Heterogeneous Information Networks (2013) (9)
Using XML to Query XML - From Theory to Practice (2004) (8)
Errata to "How hard is to marry at random? (On the approximation of the permanent)". (1988) (8)
The Future of Web Search: From Information Retrieval to Information Supply (2006) (8)
Balanced Allocations for Tree-Like Inputs (1995) (8)
Pattern-based compression of text images (1996) (8)
Cross-lingual query classification: a preliminary study (2008) (8)
Completeness and robustness properties of min-wise independent permutations (1999) (8)
Weighted random mappings; properties and applications (1985) (8)
Domain-Specific Query Augmentation using Folksonomy Tags: the Case of Contextual Advertising (2008) (7)
Universal sequences and graph cover times: a short survey (1990) (7)
The cost distribution of clustering in random probing (1990) (7)
The Next Generation Web Search and the Demise of the Classic IR Model (2007) (6)
Proceedings of the 2008 International Conference on Web Search and Data Mining (2008) (6)
Broder and Mitzenmacher : Network Applications of Bloom Filters : A Survey 487 (2002) (6)
Efficiently evaluating graph constraints in content-based publish/subscribe (2011) (6)
A provably secure polynomial approximation scheme for the distributed lottery problem (extended abstract) (1985) (6)
Algorithms and Models for the Web-Graph, Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007) (6)
Multidimensional balanced allocations (2005) (6)
Min-Wise versus linear independence (extended abstract) (2000) (5)
The Bow-Tie web (2000) (5)
Pessimal algorithms and simplexity analysis (1984) (5)
Search is dead!: long live search (2010) (5)
On-line Load Balancing (Extended Abstract) (1992) (5)
Big Data: New Paradigm or "Sound and Fury, Signifying Nothing"? (2015) (4)
W3C XML Path Language (2009) (4)
Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science (2000) (4)
Dynamic Packet Routing on Arrays with Bounded Buffers (1998) (4)
Learning Effective Embeddings for Machine Generated Emails with Applications to Email Category Prediction (2018) (3)
Reviewing the Reviewers: Characterizing Biases and Competencies using Socially Meaningful Attributes (2008) (3)
Current trends in the integration of searching and browsing (2005) (3)
A Note on Double Pooling Tests (Preliminary version) (2020) (3)
Introduction to display advertising: a half-day tutorial (2011) (3)
Keynote Address - exploring, modeling, and using the web graph (2003) (3)
Optimizing relevance and revenue in ad search (2008) (3)
Information retrieval challenges in computational advertising (2010) (2)
Modelling and Mining of Networked Information Spaces (2007) (2)
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). (1997) (2)
A note on search based forecasting of ad volume in contextual advertising (2008) (2)
An introduction to online targeted advertising: principles, implementation, controversies (2011) (2)
Finding anything in the billion page Web: are algorithms the key? (1999) (2)
Bounds on the Cover Time (Preliminary Version) (1988) (1)
Weighted random mappings; properties and applications (integer factorization, pollard's rmo method) (1985) (1)
Unscrambling address lines (1999) (1)
Informatin Retrieval on the Web (1998) (1)
Information retrieval challenges in computational advertising (2011) (1)
How search engines shape the web (2005) (1)
Finding Hidden Hamiltonian Cycles (Extended Abstract) (1991) (1)
8 Concluding Remarks and Further Work (2007) (0)
W3C XML Query Language (2009) (0)
A grand research challenge : Plug and play architecture for knowledge management (2002) (0)
Wide-Area Data Replication (2009) (0)
Work Element (2009) (0)
Session details: Query result processing (2004) (0)
WWW'14 program chairs' welcome (2014) (0)
IR paradigms in computational advertising (2012) (0)
Operator Drowsiness Test (2019) (0)
2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology - Title (2007) (0)
Placing Tiles in the Plane (1985) (0)
Using Multiple Hash Fun tions to Improve IPLookupsAndrei (2000) (0)
6.2.2 Relative Cost (2011) (0)
WWW 2009 Refereed Track: Internet Monetization (2009) (0)
Invited Talk: The Many Wonders of the Web Graph (2004) (0)
Web Application Server (2009) (0)
Highly Dimensional Problems in Computational Advertising (2011) (0)
Finding free registers (1998) (0)
Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008 (2008) (0)
Querying the past, present and future: where we are and where we will be (2005) (0)
2010 IEEE International Conference on Granular Computing, GrC 2010, San Jose, California, USA, 14-16 August 2010 (2010) (0)
A Derandomization Using Min-Wise Independent Permutations Extended abstract for submission to Random ’ 98 not for distribution (1998) (0)
The Anatomy of the Long Tail of Consumer Demand (2010) (0)
2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology - Title (2007) (0)
Information Processing Letters running time of the random simplex algorithm is exponential in the height (1995) (0)
Algorithmic Challenge in Online Advertising (2009) (0)
January 08 , 2019 Operator Drowsiness Test (2019) (0)
A Call to Arms: Embrace Assistive AI Systems! (2018) (0)
Session details: Keynote talks (2014) (0)
2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology - Cover (2007) (0)
Dr . Frankenstein ’ s Approach to On-line Algorithms ( Extended abstract ) (0)
Web Content Extraction (2009) (0)
Session details: Content quality & popularity (2014) (0)
Information extraction meets relation databases (2009) (0)
Session details: Session 1: Practice & Experience Talk + Panel on Large Scale Data Understanding (2015) (0)
A Personal Perspective and Retrospective on Web Search Technology (2016) (0)
Dynamic Packet Rout ing on Arrays with B o u n d e d Buffers (0)

This paper list is powered by the following services:

Other Resources About Andrei Broder

en.wikipedia.org

What Schools Are Affiliated With Andrei Broder?

Andrei Broder is affiliated with the following schools:

Image Attributions

Image Source for Andrei Broder