| 2009 |
|---|
| 115 | EE | Xuerui Wang,
Andrei Z. Broder,
Evgeniy Gabrilovich,
Vanja Josifovski,
Bo Pang:
Cross-language query classification using web search for exogenous knowledge.
WSDM 2009: 74-83 |
| 114 | EE | Sandeep Pandey,
Andrei Z. Broder,
Flavio Chierichetti,
Vanja Josifovski,
Ravi Kumar,
Sergei Vassilvitskii:
Nearest-neighbor caching for content-match applications.
WWW 2009: 441-450 |
| 113 | EE | Xuerui Wang,
Andrei Z. Broder,
Marcus Fontoura,
Vanja Josifovski:
A search-based method for forecasting ad impression in contextual advertising.
WWW 2009: 491-500 |
| 112 | EE | Andrei Z. Broder,
Peter Ciccolo,
Evgeniy Gabrilovich,
Vanja Josifovski,
Donald Metzler,
Lance Riedel,
Jeffrey Yuan:
Online expansion of rare queries for sponsored search.
WWW 2009: 511-520 |
| 111 | EE | Evgeniy Gabrilovich,
Andrei Z. Broder,
Marcus Fontoura,
Amruta Joshi,
Vanja Josifovski,
Lance Riedel,
Tong Zhang:
Classifying search queries using the Web as a source of knowledge.
TWEB 3(2): (2009) |
| 2008 |
|---|
| 110 | | Marc Najork,
Andrei Z. Broder,
Soumen Chakrabarti:
Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008
ACM 2008 |
| 109 | | William Aiello,
Andrei Z. Broder,
Jeannette C. M. Janssen,
Evangelos E. Milios:
Algorithms and Models for the Web-Graph, Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers
Springer 2008 |
| 108 | EE | Andrei Z. Broder,
Massimiliano Ciaramita,
Marcus Fontoura,
Evgeniy Gabrilovich,
Vanja Josifovski,
Donald Metzler,
Vanessa Murdock,
Vassilis Plachouras:
To swing or not to swing: learning when (not) to advertise.
CIKM 2008: 1003-1012 |
| 107 | EE | Andrei Z. Broder,
Peter Ciccolo,
Marcus Fontoura,
Evgeniy Gabrilovich,
Vanja Josifovski,
Lance Riedel:
Search advertising using web relevance feedback.
CIKM 2008: 1013-1022 |
| 106 | EE | Xuerui Wang,
Andrei Z. Broder,
Marcus Fontoura,
Vanja Josifovski:
A note on search based forecasting of ad volume in contextual advertising.
CIKM 2008: 1343-1344 |
| 105 | EE | Andrei Z. Broder:
Computational advertising and recommender systems.
RecSys 2008: 1-2 |
| 104 | EE | Filip Radlinski,
Andrei Z. Broder,
Peter Ciccolo,
Evgeniy Gabrilovich,
Vanja Josifovski,
Lance Riedel:
Optimizing relevance and revenue in ad search: a query substitution approach.
SIGIR 2008: 403-410 |
| 103 | EE | Andrei Z. Broder,
Adam Kirsch,
Ravi Kumar,
Michael Mitzenmacher,
Eli Upfal,
Sergei Vassilvitskii:
The hiring problem and Lake Wobegon strategies.
SODA 2008: 1184-1193 |
| 102 | EE | Andrei Z. Broder:
Computational advertising.
SODA 2008: 992 |
| 101 | EE | Aris Anagnostopoulos,
Andrei Z. Broder,
Kunal Punera:
Effective and efficient classification on a search-engine model.
Knowl. Inf. Syst. 16(2): 129-154 (2008) |
| 100 | EE | Einat Amitay,
Andrei Z. Broder:
Introduction to special issue on query log analysis: Technology and ethics.
TWEB 2(4): (2008) |
| 2007 |
|---|
| 99 | EE | Aris Anagnostopoulos,
Andrei Z. Broder,
Evgeniy Gabrilovich,
Vanja Josifovski,
Lance Riedel:
Just-in-time contextual advertising.
CIKM 2007: 331-340 |
| 98 | EE | Maria-Florina Balcan,
Andrei Z. Broder,
Tong Zhang:
Margin Based Active Learning.
COLT 2007: 35-50 |
| 97 | EE | Andrei Z. Broder:
The Next Generation Web Search and the Demise of the Classic IR Model.
ECIR 2007: 1 |
| 96 | EE | Deepak Agarwal,
Andrei Z. Broder,
Deepayan Chakrabarti,
Dejan Diklic,
Vanja Josifovski,
Mayssam Sayyadian:
Estimating rates of rare events at multiple resolutions.
KDD 2007: 16-25 |
| 95 | EE | Andrei Z. Broder,
Marcus Fontoura,
Evgeniy Gabrilovich,
Amruta Joshi,
Vanja Josifovski,
Tong Zhang:
Robust classification of rare queries using web knowledge.
SIGIR 2007: 231-238 |
| 94 | EE | Andrei Z. Broder,
Marcus Fontoura,
Vanja Josifovski,
Lance Riedel:
A semantic approach to contextual advertising.
SIGIR 2007: 559-566 |
| 2006 |
|---|
| 93 | EE | Aris Anagnostopoulos,
Andrei Z. Broder,
Kunal Punera:
Effective and efficient classification on a search-engine model.
CIKM 2006: 208-217 |
| 92 | EE | Andrei Z. Broder,
Marcus Fontoura,
Vanja Josifovski,
Ravi Kumar,
Rajeev Motwani,
Shubha U. Nabar,
Rina Panigrahy,
Andrew Tomkins,
Ying Xu:
Estimating corpus size via queries.
CIKM 2006: 594-603 |
| 91 | EE | Andrei Z. Broder,
Nadav Eiron,
Marcus Fontoura,
Michael Herscovici,
Ronny Lempel,
John McPherson,
Runping Qi,
Eugene J. Shekita:
Indexing Shared Content in Information Retrieval Systems.
EDBT 2006: 313-330 |
| 90 | EE | Andrei Z. Broder:
The Future of Web Search: From Information Retrieval to Information Supply.
NGITS 2006: 362 |
| 89 | EE | William Aiello,
Andrei Z. Broder,
Jeannette Janssen,
Evangelos E. Milios:
Modelling and Mining of Networked Information Spaces.
WAW 2006: 1-17 |
| 88 | EE | William Aiello,
Andrei Z. Broder,
Jeannette Janssen,
Evangelos E. Milios:
Workshop on Algorithms and Models for the Web Graph.
WAW 2006: 18-23 |
| 87 | EE | Andrei Z. Broder,
Ronny Lempel,
Farzin Maghoul,
Jan O. Pedersen:
Efficient PageRank approximation via graph aggregation.
Inf. Retr. 9(2): 123-138 (2006) |
| 86 | EE | Aris Anagnostopoulos,
Andrei Z. Broder,
David Carmel:
Sampling Search-Engine Results.
World Wide Web 9(4): 397-429 (2006) |
| 2005 |
|---|
| 85 | EE | Andrei Z. Broder,
Michael Mitzenmacher:
Multidimensional balanced allocations.
SODA 2005: 195-196 |
| 84 | EE | Aris Anagnostopoulos,
Andrei Z. Broder,
David Carmel:
Sampling search-engine results.
WWW 2005: 245-256 |
| 83 | EE | Andrei Z. Broder,
Yoëlle S. Maarek,
Krishna Bharat,
Susan T. Dumais,
Steve Papa,
Jan O. Pedersen,
Prabhakar Raghavan:
Current trends in the integration of searching and browsing.
WWW (Special interest tracks and posters) 2005: 793 |
| 82 | EE | Ling Liu,
Andrei Z. Broder,
Dieter Fensel,
Carole A. Goble,
Calton Pu:
Querying the past, present and future: where we are and where we will be.
WWW (Special interest tracks and posters) 2005: 798 |
| 81 | EE | Byron Dom,
Krishna Bharat,
Andrei Z. Broder,
Marc Najork,
Jan O. Pedersen,
Yoshinobu Tonomura:
How search engines shape the web.
WWW (Special interest tracks and posters) 2005: 879 |
| 2004 |
|---|
| 80 | EE | Andrei Z. Broder:
Invited Talk: The Many Wonders of the Web Graph.
CAAN 2004: 154-154 |
| 79 | | Andrei Z. Broder,
Yoëlle S. Maarek,
Matan Mandelbrod,
Yosi Mass:
Using XML to Query XML - From Theory to Practice.
RIAO 2004: 582-594 |
| 78 | EE | Ziv Bar-Yossef,
Andrei Z. Broder,
Ravi Kumar,
Andrew Tomkins:
Sic transit gloria telae: towards an understanding of the web's decay.
WWW 2004: 328-337 |
| 77 | EE | Andrei Z. Broder,
Ronny Lempel,
Farzin Maghoul,
Jan O. Pedersen:
Efficient pagerank approximation via graph aggregation.
WWW (Alternate Track Papers & Posters) 2004: 484-485 |
| 76 | EE | Andrei Z. Broder,
Arthur C. Ciccolo:
Towards the next generation of enterprise search technology.
IBM Systems Journal 43(3): 451-454 (2004) |
| 2003 |
|---|
| 75 | EE | Andrei Z. Broder,
David Carmel,
Michael Herscovici,
Aya Soffer,
Jason Y. Zien:
Efficient query evaluation using a two-level retrieval process.
CIKM 2003: 426-434 |
| 74 | EE | Andrei Z. Broder:
Keynote Address - exploring, modeling, and using the web graph.
SIGIR 2003: 1 |
| 73 | EE | Andrei Z. Broder,
Marc Najork,
Janet L. Wiener:
Efficient URL caching for world wide web crawling.
WWW 2003: 679-689 |
| 72 | | Andrei Z. Broder,
Michael Mitzenmacher:
Survey: Network Applications of Bloom Filters: A Survey.
Internet Mathematics 1(4): (2003) |
| 71 | EE | Andrei Z. Broder,
Moses Charikar,
Michael Mitzenmacher:
A derandomization using min-wise independent permutations.
J. Discrete Algorithms 1(1): 11-20 (2003) |
| 2002 |
|---|
| 70 | EE | Andrei Z. Broder,
Michael Mitzenmacher:
Optmial plans for aggregation.
PODC 2002: 144-152 |
| 69 | EE | Andrei Z. Broder:
A taxonomy of web search.
SIGIR Forum 36(2): 3-10 (2002) |
| 2001 |
|---|
| 68 | EE | Andrei Z. Broder,
Michael Mitzenmacher:
Using Multiple Hash Functions to Improve IP Lookups.
INFOCOM 2001: 1454-1463 |
| 67 | EE | Andrei Z. Broder,
Alan M. Frieze,
Eli Upfal:
A general approach to dynamic packet routing with bounded buffers.
J. ACM 48(2): 324-349 (2001) |
| 66 | | Andrei Z. Broder,
Michael Mitzenmacher:
Completeness and robustness properties of min-wise independent permutations.
Random Struct. Algorithms 18(1): 18-30 (2001) |
| 2000 |
|---|
| 65 | EE | Andrei Z. Broder:
Identifying and Filtering Near-Duplicate Documents.
CPM 2000: 1-10 |
| 64 | EE | Andrei Z. Broder:
Min-wise Independent Permutations: Theory and Practice.
ICALP 2000: 808 |
| 63 | | Andrei Z. Broder:
Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science.
ICALP Satellite Workshops 2000: 1-2 |
| 62 | EE | Andrei Z. Broder,
Uriel Feige:
Min-Wise versus linear independence (extended abstract).
SODA 2000: 147-154 |
| 61 | EE | Andrei Z. Broder,
Robert Krauthgamer,
Michael Mitzenmacher:
Improved classification via connectivity information.
SODA 2000: 576-585 |
| 60 | EE | Andrei Z. Broder,
Ravi Kumar,
Farzin Maghoul,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Raymie Stata,
Andrew Tomkins,
Janet L. Wiener:
Graph structure in the Web.
Computer Networks 33(1-6): 309-320 (2000) |
| 59 | EE | Krishna Bharat,
Andrei Z. Broder,
Jeffrey Dean,
Monika Rauch Henzinger:
A Comparison of Techniques to Find Mirrored Hosts on the WWW.
IEEE Data Eng. Bull. 23(4): 21-26 (2000) |
| 58 | EE | Li Fan,
Pei Cao,
Jussara M. Almeida,
Andrei Z. Broder:
Summary cache: a scalable wide-area web cache sharing protocol.
IEEE/ACM Trans. Netw. 8(3): 281-293 (2000) |
| 57 | | Andrei Z. Broder,
Moses Charikar,
Alan M. Frieze,
Michael Mitzenmacher:
Min-Wise Independent Permutations.
J. Comput. Syst. Sci. 60(3): 630-659 (2000) |
| 56 | | Krishna Bharat,
Andrei Z. Broder,
Jeffrey Dean,
Monika Rauch Henzinger:
A comparison of techniques to find mirrored hosts on the WWW.
JASIS 51(12): 1114-1122 (2000) |
| 1999 |
|---|
| 55 | | Andrei Z. Broder,
Michael Mitzenmacher:
Completeness and Robustness Properties of Min-Wise Independent Permutations.
RANDOM-APPROX 1999: 1-10 |
| 54 | EE | Andrei Z. Broder,
Michael Mitzenmacher,
Laurent Moll:
Unscrambling Address Lines.
SODA 1999: 870-871 |
| 53 | | Krishna Bharat,
Andrei Z. Broder,
Jeffrey Dean,
Monika Rauch Henzinger:
A Comparison of Techniques to Find Mirrored Hosts on the WWW.
WOWS 1999: 2-12 |
| 52 | EE | Krishna Bharat,
Andrei Z. Broder:
Mirror, Mirror on the Web: A Study of Host Pairs with Replicated Content.
Computer Networks 31(11-16): 1579-1590 (1999) |
| 51 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Upfal:
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach.
Random Struct. Algorithms 14(1): 87-109 (1999) |
| 50 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin,
Eli Upfal:
Balanced Allocations.
SIAM J. Comput. 29(1): 180-200 (1999) |
| 1998 |
|---|
| 49 | EE | Andrei Z. Broder,
Monika Rauch Henzinger:
Information Retrieval on the Web.
FOCS 1998: 6 |
| 48 | EE | Andrei Z. Broder,
Alan M. Frieze,
Eli Upfal:
Dynamic Packet Routing on Arrays with Bounded Buffers.
LATIN 1998: 273-281 |
| 47 | EE | Andrei Z. Broder,
Moses Charikar,
Michael Mitzenmacher:
A Derandomization Using Min-Wise Independent Permutations.
RANDOM 1998: 15-24 |
| 46 | EE | Li Fan,
Pei Cao,
Jussara M. Almeida,
Andrei Z. Broder:
Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol.
SIGCOMM 1998: 254-265 |
| 45 | EE | Andrei Z. Broder,
Moses Charikar,
Alan M. Frieze,
Michael Mitzenmacher:
Min-Wise Independent Permutations (Extended Abstract).
STOC 1998: 327-336 |
| 44 | EE | Krishna Bharat,
Andrei Z. Broder:
A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines.
Computer Networks 30(1-7): 379-388 (1998) |
| 43 | EE | Krishna Bharat,
Andrei Z. Broder,
Monika Rauch Henzinger,
Puneet Kumar,
Suresh Venkatasubramanian:
The Connectivity Server: Fast Access to Linkage Information on the Web.
Computer Networks 30(1-7): 469-477 (1998) |
| 42 | | Andrei Z. Broder,
Alan M. Frieze,
Stephen Suen,
Eli Upfal:
Optimal Construction of Edge-Disjoint Paths in Random Graphs.
SIAM J. Comput. 28(2): 541-573 (1998) |
| 1997 |
|---|
| 41 | EE | Andrei Z. Broder,
Alan M. Frieze,
Eli Upfal:
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version).
STOC 1997: 531-539 |
| 40 | EE | Andrei Z. Broder,
Steven C. Glassman,
Mark S. Manasse,
Geoffrey Zweig:
Syntactic Clustering of the Web.
Computer Networks 29(8-13): 1157-1166 (1997) |
| 39 | | Andrei Z. Broder,
Ernst W. Mayr:
Counting Minimum Weight Spanning Trees.
J. Algorithms 24(1): 171-176 (1997) |
| 1996 |
|---|
| 38 | | Andrei Z. Broder,
Michael Mitzenmacher:
Pattern-based Compression of Text Images.
Data Compression Conference 1996: 300-309 |
| 37 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Upfal:
A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract).
FOCS 1996: 390-399 |
| 36 | | Andrei Z. Broder,
Alan M. Frieze,
Stephen Suen,
Eli Upfal:
An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs.
SODA 1996: 261-268 |
| 35 | EE | Andrei Z. Broder,
Eli Upfal:
Dynamic Deflection Routing on Arrays (Preliminary Version).
STOC 1996: 348-355 |
| 34 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin,
Nathan Linial,
Steven Phillips:
Biased Random Walks.
Combinatorica 16(1): 1-18 (1996) |
| 1995 |
|---|
| 33 | EE | Andrei Z. Broder,
Alan M. Frieze,
Carsten Lund,
Steven Phillips,
Nick Reingold:
Balanced Allocations for Tree-Like Inputs.
Inf. Process. Lett. 55(6): 329-332 (1995) |
| 32 | EE | Andrei Z. Broder,
Martin E. Dyer,
Alan M. Frieze,
Prabhakar Raghavan,
Eli Upfal:
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height.
Inf. Process. Lett. 56(2): 79-81 (1995) |
| 1994 |
|---|
| 31 | | Andrei Z. Broder,
Alan M. Frieze,
Stephen Suen,
Eli Upfal:
Optimal Construction of Edge-Disjoint Paths in Random Graphs.
SODA 1994: 603-612 |
| 30 | EE | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin,
Eli Upfal:
Balanced allocations (extended abstract).
STOC 1994: 593-602 |
| 29 | | Yossi Azar,
Andrei Z. Broder,
Alan M. Frieze:
On the Problem of Approximating the Number of Bases of a Matroid.
Inf. Process. Lett. 50(1): 9-11 (1994) |
| 28 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Shamir:
Finding Hidden Hamiltonian Cycles.
Random Struct. Algorithms 5(3): 395-411 (1994) |
| 27 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Shamir,
Eli Upfal:
Near-perfect Token Distribution.
Random Struct. Algorithms 5(4): 559-572 (1994) |
| 26 | | Andrei Z. Broder,
Anna R. Karlin,
Prabhakar Raghavan,
Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity.
SIAM J. Comput. 23(2): 324-334 (1994) |
| 25 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Upfal:
Existence and Construction of Edge-Disjoint Paths on Expander Graphs.
SIAM J. Comput. 23(5): 976-989 (1994) |
| 24 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin:
On-Line Load Balancing.
Theor. Comput. Sci. 130(1): 73-84 (1994) |
| 1993 |
|---|
| 23 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Upfal:
On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas.
SODA 1993: 322-330 |
| 22 | | Yossi Azar,
Andrei Z. Broder,
Mark S. Manasse:
On-line Choice of On-line Algorithms.
SODA 1993: 432-440 |
| 1992 |
|---|
| 21 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin:
On-line Load Balancing (Extended Abstract)
FOCS 1992: 218-225 |
| 20 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Shamir,
Eli Upfal:
Near-perfect Token Distribution.
ICALP 1992: 308-317 |
| 19 | | Yossi Azar,
Andrei Z. Broder,
Anna R. Karlin,
Nathan Linial,
Steven Phillips:
Biased Random Walks
STOC 1992: 1-9 |
| 18 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Upfal:
Existence and Construction of Edge Disjoint Paths on Expander Graphs
STOC 1992: 140-149 |
| 1991 |
|---|
| 17 | | Andrei Z. Broder,
Anna R. Karlin,
Prabhakar Raghavan,
Eli Upfal:
On the Parallel Complexity of Evaluating Game Trees.
SODA 1991: 404-413 |
| 16 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Shamir:
Finding Hidden Hamiltonian Cycles (Extended Abstract)
STOC 1991: 182-189 |
| 1990 |
|---|
| 15 | | Andrei Z. Broder,
Anna R. Karlin:
Multilevel Adaptive Hashing.
SODA 1990: 43-53 |
| 14 | EE | Béla Bollobás,
Andrei Z. Broder,
István Simon:
The Cost Distribution of Clustering in Random Probing
J. ACM 37(2): 224-237 (1990) |
| 1989 |
|---|
| 13 | | Andrei Z. Broder:
Generating Random Spanning Trees
FOCS 1989: 442-447 |
| 12 | | Andrei Z. Broder,
Anna R. Karlin,
Prabhakar Raghavan,
Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity
STOC 1989: 543-549 |
| 1988 |
|---|
| 11 | EE | Martín Abadi,
Eric Allender,
Andrei Z. Broder,
Joan Feigenbaum,
Lane A. Hemachandra:
On Generating Solved Instances of Computational Problems.
CRYPTO 1988: 297-310 |
| 10 | | Andrei Z. Broder,
Anna R. Karlin:
Bounds on the Cover Time (Preliminary Version)
FOCS 1988: 479-487 |
| 9 | | Andrei Z. Broder:
Errata to ``How hard is to marry at random? (On the approximation of the permanent)''
STOC 1988: 551 |
| 1987 |
|---|
| 8 | | Andrei Z. Broder,
Eli Shamir:
On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)
FOCS 1987: 286-294 |
| 7 | | Andrei Z. Broder,
Danny Dolev,
Michael J. Fischer,
Barbara Simons:
Efficient Fault-Tolerant Routings in Networks
Inf. Comput. 75(1): 52-64 (1987) |
| 1986 |
|---|
| 6 | | Andrei Z. Broder:
How hard is to marry at random? (On the approximation of the permanent)
STOC 1986: 50-58 |
| 1985 |
|---|
| 5 | | Andrei Z. Broder,
Barbara Simons:
Placing Tiles in the Plane.
FODO 1985: 207-223 |
| 4 | | Andrei Z. Broder:
A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract).
PODC 1985: 136-148 |
| 1984 |
|---|
| 3 | | Andrei Z. Broder,
Danny Dolev:
Flipping coins in many pockets (Byzantine agreement on uniformly random values)
FOCS 1984: 157-170 |
| 2 | | Andrei Z. Broder,
Danny Dolev,
Michael J. Fischer,
Barbara Simons:
Efficient Fault Tolerant Routings in Networks
STOC 1984: 536-541 |
| 1 | EE | Andrei Z. Broder:
The r-Stirling numbers.
Discrete Mathematics 49(3): 241-259 (1984) |
