Andrei Z. Broder

According to our database1, Andrei Z. Broder authored at least 143 papers between 1984 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2007, "For contributions to algorithms and web technology.".

IEEE Fellow

IEEE Fellow 2006, "For contributions to the theory and application of randomized algorithms.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
A Call to Arms: Embrace Assistive AI Systems!
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

2017
Email Category Prediction.
Proceedings of the 26th International Conference on World Wide Web Companion, 2017

2016
A Personal Perspective and Retrospective on Web Search Technology.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
Big Data: New Paradigm or "Sound and Fury, Signifying Nothing"?
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

2014
Scalable K-Means by ranked retrieval.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

2012
IR paradigms in computational advertising.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

2011
Web Page Summarization for Just-in-Time Contextual Advertising.
ACM TIST, 2011

Efficiently evaluating graph constraints in content-based publish/subscribe.
Proceedings of the 20th International Conference on World Wide Web, 2011

Introduction to display advertising: a half-day tutorial.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Bid generation for advanced match in sponsored search.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Highly Dimensional Problems in Computational Advertising.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011

An introduction to online targeted advertising: principles, implementation, controversies.
Proceedings of the 16th International Conference on Intelligent User Interfaces, 2011

Information retrieval challenges in computational advertising.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
Competing for users' attention: on the interplay between organic and sponsored search results.
Proceedings of the 19th International Conference on World Wide Web, 2010

Search is dead!: long live search.
Proceedings of the 19th International Conference on World Wide Web, 2010

Automatic generation of bid phrases for online advertising.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

Anatomy of the long tail: ordinary people with extraordinary tastes.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

The Anatomy of the Long Tail of Consumer Demand.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

Information retrieval challenges in computational advertising.
Proceedings of the Proceeding of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2010

The New Frontier of Web Search Technology: Seven Challenges.
Proceedings of the Search Computing, 2010

Exploiting site-level information to improve web search.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Web Advertising.
Proceedings of the Encyclopedia of Database Systems, 2009

Classifying search queries using the Web as a source of knowledge.
TWEB, 2009

The Hiring Problem and Lake Wobegon Strategies.
SIAM J. Comput., 2009

A search-based method for forecasting ad impression in contextual advertising.
Proceedings of the 18th International Conference on World Wide Web, 2009

Nearest-neighbor caching for content-match applications.
Proceedings of the 18th International Conference on World Wide Web, 2009

Online expansion of rare queries for sponsored search.
Proceedings of the 18th International Conference on World Wide Web, 2009

Cross-language query classification using web search for exogenous knowledge.
Proceedings of the Second International Conference on Web Search and Web Data Mining, 2009

Context transfer in search advertising.
Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2009

Information extraction meets relation databases.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

What happens after an ad click?: quantifying the impact of landing pages in web advertising.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

Algorithmic Challenge in Online Advertising.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
Introduction to special issue on query log analysis: Technology and ethics.
TWEB, 2008

Effective and efficient classification on a search-engine model.
Knowl. Inf. Syst., 2008

The hiring problem and Lake Wobegon strategies.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Computational advertising.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Optimizing relevance and revenue in ad search: a query substitution approach.
Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2008

Computational advertising and recommender systems.
Proceedings of the 2008 ACM Conference on Recommender Systems, 2008

Cross-lingual query classification: a preliminary study.
Proceedings of the Proceeding of the 2nd ACM workshop on Improving Non English Web Searching, 2008

A note on search based forecasting of ad volume in contextual advertising.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

Search advertising using web relevance feedback.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

To swing or not to swing: learning when (not) to advertise.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

Reviewing the Reviewers: Characterizing Biases and Competencies using Socially Meaningful Attributes.
Proceedings of the Social Information Processing, 2008

2007
A semantic approach to contextual advertising.
Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007

Robust classification of rare queries using web knowledge.
Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007

Estimating rates of rare events at multiple resolutions.
Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007

The Next Generation Web Search and the Demise of the Classic IR Model.
Proceedings of the Advances in Information Retrieval, 2007

Margin Based Active Learning.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

Just-in-time contextual advertising.
Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

2006
Sampling Search-Engine Results.
World Wide Web, 2006

Efficient PageRank approximation via graph aggregation.
Inf. Retr., 2006

Workshop on Algorithms and Models for the Web Graph.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

Modelling and Mining of Networked Information Spaces.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

The Future of Web Search: From Information Retrieval to Information Supply.
Proceedings of the Next Generation Information Technologies and Systems, 2006

Indexing Shared Content in Information Retrieval Systems.
Proceedings of the Advances in Database Technology, 2006

Estimating corpus size via queries.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

Effective and efficient classification on a search-engine model.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

2005
Querying the past, present and future: where we are and where we will be.
Proceedings of the 14th international conference on World Wide Web, 2005

How search engines shape the web.
Proceedings of the 14th international conference on World Wide Web, 2005

Current trends in the integration of searching and browsing.
Proceedings of the 14th international conference on World Wide Web, 2005

Sampling search-engine results.
Proceedings of the 14th international conference on World Wide Web, 2005

Multidimensional balanced allocations.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Towards the next generation of enterprise search technology.
IBM Systems Journal, 2004

Efficient pagerank approximation via graph aggregation.
Proceedings of the 13th international conference on World Wide Web, 2004

Sic transit gloria telae: towards an understanding of the web's decay.
Proceedings of the 13th international conference on World Wide Web, 2004

Using XML to Query XML - From Theory to Practice.
Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 2004

Invited Talk: The Many Wonders of the Web Graph.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
A derandomization using min-wise independent permutations.
J. Discrete Algorithms, 2003

Survey: Network Applications of Bloom Filters: A Survey.
Internet Mathematics, 2003

Efficient URL caching for world wide web crawling.
Proceedings of the Twelfth International World Wide Web Conference, 2003

Keynote Address - exploring, modeling, and using the web graph.
Proceedings of the SIGIR 2003: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 28, 2003

Efficient query evaluation using a two-level retrieval process.
Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, 2003

2002
A taxonomy of web search.
SIGIR Forum, 2002

Optmial plans for aggregation.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Completeness and robustness properties of min-wise independent permutations.
Random Struct. Algorithms, 2001

A general approach to dynamic packet routing with bounded buffers.
J. ACM, 2001

Using Multiple Hash Functions to Improve IP Lookups.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

2000
Summary cache: a scalable wide-area web cache sharing protocol.
IEEE/ACM Trans. Netw., 2000

Min-Wise Independent Permutations.
J. Comput. Syst. Sci., 2000

A comparison of techniques to find mirrored hosts on the WWW.
JASIS, 2000

A Comparison of Techniques to Find Mirrored Hosts on the WWW.
IEEE Data Eng. Bull., 2000

Graph structure in the Web.
Computer Networks, 2000

Improved classification via connectivity information.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Min-Wise versus linear independence (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science.
ICALP Satellite Workshops, 2000

Min-wise Independent Permutations: Theory and Practice.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Identifying and Filtering Near-Duplicate Documents.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
Balanced Allocations.
SIAM J. Comput., 1999

Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach.
Random Struct. Algorithms, 1999

Mirror, Mirror on the Web: A Study of Host Pairs with Replicated Content.
Computer Networks, 1999

Unscrambling Address Lines.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Completeness and Robustness Properties of Min-Wise Independent Permutations.
Proceedings of the Randomization, 1999

A Comparison of Techniques to Find Mirrored Hosts on the WWW.
Proceedings of the 1999 ACM Digital Library Workshop on Organizing Web Space (WOWS), 1999

1998
Optimal Construction of Edge-Disjoint Paths in Random Graphs.
SIAM J. Comput., 1998

The Connectivity Server: Fast Access to Linkage Information on the Web.
Computer Networks, 1998

A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines.
Computer Networks, 1998

Min-Wise Independent Permutations (Extended Abstract).
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol.
SIGCOMM, 1998

A Derandomization Using Min-Wise Independent Permutations.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Dynamic Packet Routing on Arrays with Bounded Buffers.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Information Retrieval on the Web.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Counting Minimum Weight Spanning Trees.
J. Algorithms, 1997

Syntactic Clustering of the Web.
Computer Networks, 1997

Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Biased Random Walks.
Combinatorica, 1996

Dynamic Deflection Routing on Arrays (Preliminary Version).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Pattern-based Compression of Text Images.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995
Balanced Allocations for Tree-Like Inputs.
Inf. Process. Lett., 1995

The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height.
Inf. Process. Lett., 1995

1994
On-Line Load Balancing.
Theor. Comput. Sci., 1994

Trading Space for Time in Undirected s-t Connectivity.
SIAM J. Comput., 1994

Existence and Construction of Edge-Disjoint Paths on Expander Graphs.
SIAM J. Comput., 1994

Near-perfect Token Distribution.
Random Struct. Algorithms, 1994

Finding Hidden Hamiltonian Cycles.
Random Struct. Algorithms, 1994

On the Problem of Approximating the Number of Bases of a Matroid.
Inf. Process. Lett., 1994

Balanced allocations (extended abstract).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Optimal Construction of Edge-Disjoint Paths in Random Graphs.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

On-line Choice of On-line Algorithms.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
Existence and Construction of Edge Disjoint Paths on Expander Graphs
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Biased Random Walks
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Near-perfect Token Distribution.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

On-line Load Balancing (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Finding Hidden Hamiltonian Cycles (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

On the Parallel Complexity of Evaluating Game Trees.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
The Cost Distribution of Clustering in Random Probing
J. ACM, April, 1990

Multilevel Adaptive Hashing.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
Trading Space for Time in Undirected s-t Connectivity
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Generating Random Spanning Trees
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Errata to "How hard is to marry at random? (On the approximation of the permanent)".
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Bounds on the Cover Time (Preliminary Version)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

On Generating Solved Instances of Computational Problems.
Proceedings of the Advances in Cryptology, 1988

1987
Efficient Fault-Tolerant Routings in Networks
Inf. Comput., October, 1987

On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
How hard is to marry at random? (On the approximation of the permanent)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
On the performance of edited nearest neighbor rules in high dimensions.
IEEE Trans. Systems, Man, and Cybernetics, 1985

A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract).
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Placing Tiles in the Plane.
FODO, 1985

1984
The r-Stirling numbers.
Discrete Mathematics, 1984

Efficient Fault Tolerant Routings in Networks
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Flipping coins in many pockets (Byzantine agreement on uniformly random values)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984


  Loading...