Andrei Z. Broder

Google Publications

Previous Publications

  •  

    An introduction to online targeted advertising: principles, implementation, controversies

    Andrei Z. Broder

    IUI (2011), pp. 103-104

  •  

    Bid generation for advanced match in sponsored search

    Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, George Mavromatis, Alex J. Smola

    WSDM (2011), pp. 515-524

  •  

    Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe

    Andrei Broder, Shirshanka Das, Marcus Fontoura, Bhaskar Ghosh, Vanja Josifovski, Jayavel Shanmugasundaram, Sergei Vassilvitskii

    The 20th International World Wide Web Confererence (WWW 2011)

  •  

    Efficiently evaluating graph constraints in content-based publish/subscribe

    Andrei Z. Broder, Shirshanka Das, Marcus Fontoura, Bhaskar Ghosh, Vanja Josifovski, Jayavel Shanmugasundaram, Sergei Vassilvitskii

    WWW (2011), pp. 497-506

  •  

    Highly Dimensional Problems in Computational Advertising

    Andrei Z. Broder

    ECML/PKDD (1) (2011), pp. 5

  •  

    Information retrieval challenges in computational advertising

    Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski

    CIKM (2011), pp. 2611-2612

  •  

    Introduction to display advertising: a half-day tutorial

    Andrei Z. Broder, Vanja Josifovski, Jayavel Shanmugasundaram

    WSDM (2011), pp. 3-4

  •  

    Web Page Summarization for Just-in-Time Contextual Advertising

    Aris Anagnostopoulos, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Lance Riedel

    ACM TIST, vol. 3 (2011), pp. 14

  •  

    Anatomy of the long tail: ordinary people with extraordinary tastes

    Sharad Goel, Andrei Z. Broder, Evgeniy Gabrilovich, Bo Pang

    WSDM (2010), pp. 201-210

  •   

    Automatic generation of bid phrases for online advertising

    Sujith Ravi, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Sandeep Pandey, Bo Pang

    Proceedings of the International Conference on Web Search and Data Mining (WSDM) (2010), pp. 341-350

  •  

    Competing for users' attention: on the interplay between organic and sponsored search results

    Cristian Danescu-Niculescu-Mizil, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang

    WWW (2010), pp. 291-300

  •  

    Exploiting site-level information to improve web search

    Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, George Mavromatis, Donald Metzler, Jane Wang

    CIKM (2010), pp. 1393-1396

  •  

    Information retrieval challenges in computational advertising

    Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski

    SIGIR (2010), pp. 908

  •  

    Search is dead!: long live search

    Andrei Z. Broder, Elizabeth F. Churchill, Marti Hearst, Barney Pell, Prabhakar Raghavan, Andrew Tomkins

    WWW (2010), pp. 1337-1338

  •  

    The Anatomy of the Long Tail of Consumer Demand

    Andrei Z. Broder

    WAW (2010), pp. 1

  •  

    The New Frontier of Web Search Technology: Seven Challenges

    Ricardo A. Baeza-Yates, Andrei Z. Broder, Yoëlle S. Maarek

    SeCO Workshop (2010), pp. 3-9

  •  

    A search-based method for forecasting ad impression in contextual advertising

    Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski

    WWW (2009), pp. 491-500

  •  

    Algorithmic Challenge in Online Advertising

    Andrei Z. Broder

    AAIM (2009), pp. 1

  •  

    Classifying search queries using the Web as a source of knowledge

    Evgeniy Gabrilovich, Andrei Z. Broder, Marcus Fontoura, Amruta Joshi, Vanja Josifovski, Lance Riedel, Tong Zhang

    TWEB, vol. 3 (2009)

  •  

    Context transfer in search advertising

    Hila Becker, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang

    SIGIR (2009), pp. 656-657

  •  

    Cross-language query classification using web search for exogenous knowledge

    Xuerui Wang, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang

    WSDM (2009), pp. 74-83

  •   

    Information extraction meets relation databases

    Davood Rafiei, Andrei Broder, Edward Chang, Patrick Pantel

    CIKM '09: Proceeding of the 18th ACM conference on Information and knowledge management, ACM, New York, NY, USA (2009), pp. 897-897

  •  

    Nearest-neighbor caching for content-match applications

    Sandeep Pandey, Andrei Z. Broder, Flavio Chierichetti, Vanja Josifovski, Ravi Kumar, Sergei Vassilvitskii

    WWW (2009), pp. 441-450

  •  

    Online expansion of rare queries for sponsored search

    Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovich, Vanja Josifovski, Donald Metzler, Lance Riedel, Jeffrey Yuan

    WWW (2009), pp. 511-520

  •  

    The Hiring Problem and Lake Wobegon Strategies

    Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii

    SIAM J. Comput., vol. 39 (2009), pp. 1233-1255

  •  

    Web Advertising

    Vanja Josifovski, Andrei Z. Broder

    Encyclopedia of Database Systems (2009), pp. 3457-3459

  •  

    What happens after an ad click?: quantifying the impact of landing pages in web advertising

    Hila Becker, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang

    CIKM (2009), pp. 57-66

  •  

    A note on search based forecasting of ad volume in contextual advertising

    Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski

    CIKM (2008), pp. 1343-1344

  •  

    Computational advertising

    Andrei Z. Broder

    SODA (2008), pp. 992

  •  

    Computational advertising and recommender systems

    Andrei Z. Broder

    RecSys (2008), pp. 1-2

  •  

    Cross-lingual query classification: a preliminary study

    Xuerui Wang, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang

    CIKM-iNEWS (2008), pp. 101-104

  •  

    Effective and efficient classification on a search-engine model

    Aris Anagnostopoulos, Andrei Z. Broder, Kunal Punera

    Knowl. Inf. Syst., vol. 16 (2008), pp. 129-154

  •  

    Introduction to special issue on query log analysis: Technology and ethics

    Einat Amitay, Andrei Z. Broder

    TWEB, vol. 2 (2008)

  •  

    Optimizing relevance and revenue in ad search: a query substitution approach

    Filip Radlinski, Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovich, Vanja Josifovski, Lance Riedel

    SIGIR (2008), pp. 403-410

  •  

    Reviewing the Reviewers: Characterizing Biases and Competencies using Socially Meaningful Attributes

    Sihem Amer-Yahia, Andrei Z. Broder, Alban Galland

    AAAI Spring Symposium: Social Information Processing (2008), pp. 1-6

  •  

    Search advertising using web relevance feedback

    Andrei Z. Broder, Peter Ciccolo, Marcus Fontoura, Evgeniy Gabrilovich, Vanja Josifovski, Lance Riedel

    CIKM (2008), pp. 1013-1022

  •  

    The hiring problem and Lake Wobegon strategies

    Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii

    SODA (2008), pp. 1184-1193

  •  

    To swing or not to swing: learning when (not) to advertise

    Andrei Z. Broder, Massimiliano Ciaramita, Marcus Fontoura, Evgeniy Gabrilovich, Vanja Josifovski, Donald Metzler, Vanessa Murdock, Vassilis Plachouras

    CIKM (2008), pp. 1003-1012

  •  

    A semantic approach to contextual advertising

    Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Lance Riedel

    SIGIR (2007), pp. 559-566

  •  

    Estimating rates of rare events at multiple resolutions

    Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrabarti, Dejan Diklic, Vanja Josifovski, Mayssam Sayyadian

    KDD (2007), pp. 16-25

  •  

    Just-in-time contextual advertising

    Aris Anagnostopoulos, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Lance Riedel

    CIKM (2007), pp. 331-340

  •  

    Margin Based Active Learning

    Maria-Florina Balcan, Andrei Z. Broder, Tong Zhang

    COLT (2007), pp. 35-50

  •  

    Robust classification of rare queries using web knowledge

    Andrei Z. Broder, Marcus Fontoura, Evgeniy Gabrilovich, Amruta Joshi, Vanja Josifovski, Tong Zhang

    SIGIR (2007), pp. 231-238

  •  

    The Next Generation Web Search and the Demise of the Classic IR Model

    Andrei Z. Broder

    ECIR (2007), pp. 1

  •  

    Effective and efficient classification on a search-engine model

    Aris Anagnostopoulos, Andrei Z. Broder, Kunal Punera

    CIKM (2006), pp. 208-217

  •  

    Efficient PageRank approximation via graph aggregation

    Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Jan O. Pedersen

    Inf. Retr., vol. 9 (2006), pp. 123-138

  •  

    Estimating corpus size via queries

    Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Rajeev Motwani, Shubha U. Nabar, Rina Panigrahy, Andrew Tomkins, Ying Xu 0002

    CIKM (2006), pp. 594-603

  •   

    Indexing Shared Content in Information Retrieval Systems

    Andrei Z. Broder, Nadav Eiron, Marcus Fontoura, Michael Herscovici, Ronny Lempel, John McPherson, Runping Qi, Eugene J. Shekita

    EDBT (2006), pp. 313-330

  •  

    Modelling and Mining of Networked Information Spaces

    William Aiello, Andrei Z. Broder, Jeannette Janssen, Evangelos E. Milios

    WAW (2006), pp. 1-17

  •  

    Sampling Search-Engine Results

    Aris Anagnostopoulos, Andrei Z. Broder, David Carmel

    World Wide Web, vol. 9 (2006), pp. 397-429

  •  

    The Future of Web Search: From Information Retrieval to Information Supply

    Andrei Z. Broder

    NGITS (2006), pp. 362

  •  

    Workshop on Algorithms and Models for the Web Graph

    William Aiello, Andrei Z. Broder, Jeannette Janssen, Evangelos E. Milios

    WAW (2006), pp. 18-23

  •   

    Current trends in the integration of searching and browsing

    Andrei Z. Broder, Yoelle S. Maarek, Krishna Bharat, Susan T. Dumais, Steve Papa, Jan O. Pedersen, Prabhakar Raghavan

    WWW (Special interest tracks and posters) (2005), pp. 793

  •   

    How search engines shape the web

    Byron Dom, Krishna Bharat, Andrei Z. Broder, Marc Najork, Jan O. Pedersen, Yoshinobu Tonomura

    WWW (Special interest tracks and posters) (2005), pp. 879

  •  

    Sampling search-engine results

    Aris Anagnostopoulos, Andrei Z. Broder, David Carmel

    WWW (2005), pp. 245-256

  •  

    Efficient pagerank approximation via graph aggregation

    Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Jan O. Pedersen

    WWW (Alternate Track Papers & Posters) (2004), pp. 484-485

  •  

    Invited Talk: The Many Wonders of the Web Graph

    Andrei Z. Broder

    CAAN (2004), pp. 154-154

  •  

    Sic transit gloria telae: towards an understanding of the web's decay

    Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andrew Tomkins

    WWW (2004), pp. 328-337

  •  

    Towards the next generation of enterprise search technology

    Andrei Z. Broder, Arthur C. Ciccolo

    IBM Systems Journal, vol. 43 (2004), pp. 451-454

  •  

    Using XML to Query XML - From Theory to Practice

    Andrei Z. Broder, Yoëlle S. Maarek, Matan Mandelbrod, Yosi Mass

    RIAO (2004), pp. 582-594

  •  

    A derandomization using min-wise independent permutations

    Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher

    J. Discrete Algorithms, vol. 1 (2003), pp. 11-20

  •  

    Efficient URL caching for world wide web crawling

    Andrei Z. Broder, Marc Najork, Janet L. Wiener

    WWW (2003), pp. 679-689

  •  

    Efficient query evaluation using a two-level retrieval process

    Andrei Z. Broder, David Carmel, Michael Herscovici, Aya Soffer, Jason Y. Zien

    CIKM (2003), pp. 426-434

  •  

    Keynote Address - exploring, modeling, and using the web graph

    Andrei Z. Broder

    SIGIR (2003), pp. 1

  •  

    Survey: Network Applications of Bloom Filters: A Survey

    Andrei Z. Broder, Michael Mitzenmacher

    Internet Mathematics, vol. 1 (2003), pp. 485-509

  •  

    A taxonomy of web search

    Andrei Z. Broder

    SIGIR Forum, vol. 36 (2002), pp. 3-10

  •  

    A general approach to dynamic packet routing with bounded buffers

    Andrei Z. Broder, Alan M. Frieze, Eli Upfal

    J. ACM, vol. 48 (2001), pp. 324-349

  •  

    Completeness and robustness properties of min-wise independent permutations

    Andrei Z. Broder, Michael Mitzenmacher

    Random Struct. Algorithms, vol. 18 (2001), pp. 18-30

  •   

    A Comparison of Techniques to Find Mirrored Hosts on the WWW

    Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger

    JASIS, vol. 51 (2000), pp. 1114-1122

  •  

    A Comparison of Techniques to Find Mirrored Hosts on the WWW

    Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger

    IEEE Data Eng. Bull., vol. 23 (2000), pp. 21-26

  •  

    Graph structure in the Web

    Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, Janet L. Wiener

    Computer Networks, vol. 33 (2000), pp. 309-320

  •  

    Identifying and Filtering Near-Duplicate Documents

    Andrei Z. Broder

    CPM (2000), pp. 1-10

  •  

    Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science

    Andrei Z. Broder

    ICALP Satellite Workshops (2000), pp. 1-2

  •  

    Min-Wise Independent Permutations

    Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher

    J. Comput. Syst. Sci., vol. 60 (2000), pp. 630-659

  •  

    Min-Wise versus linear independence (extended abstract)

    Andrei Z. Broder, Uriel Feige

    SODA (2000), pp. 147-154

  •  

    Min-wise Independent Permutations: Theory and Practice

    Andrei Z. Broder

    ICALP (2000), pp. 808

  •  

    A Comparison of Techniques to Find Mirrored Hosts on the WWW

    Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger

    WOWS (1999), pp. 2-12

  •  

    Balanced Allocations

    Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal

    SIAM J. Comput., vol. 29 (1999), pp. 180-200

  •  

    Completeness and Robustness Properties of Min-Wise Independent Permutations

    Andrei Z. Broder, Michael Mitzenmacher

    RANDOM-APPROX (1999), pp. 1-10

  •   

    Mirror, Mirror on the Web: A Study of Host Pairs with Replicated Content

    Krishna Bharat, Andrei Z. Broder

    Computer Networks, vol. 31 (1999), pp. 1579-1590

  •  

    Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach

    Andrei Z. Broder, Alan M. Frieze, Eli Upfal

    Random Struct. Algorithms, vol. 14 (1999), pp. 87-109

  •  

    A Derandomization Using Min-Wise Independent Permutations

    Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher

    RANDOM (1998), pp. 15-24

  •   

    A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines

    Krishna Bharat, Andrei Z. Broder

    Computer Networks, vol. 30 (1998), pp. 379-388

  •  

    Dynamic Packet Routing on Arrays with Bounded Buffers

    Andrei Z. Broder, Alan M. Frieze, Eli Upfal

    LATIN (1998), pp. 273-281

  •  

    Min-Wise Independent Permutations (Extended Abstract)

    Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher

    STOC (1998), pp. 327-336

  •  

    Optimal Construction of Edge-Disjoint Paths in Random Graphs

    Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal

    SIAM J. Comput., vol. 28 (1998), pp. 541-573

  •   

    The Connectivity Server: Fast Access to Linkage Information on the Web

    Krishna Bharat, Andrei Z. Broder, Monika Rauch Henzinger, Puneet Kumar, Suresh Venkatasubramanian

    Computer Networks, vol. 30 (1998), pp. 469-477

  •  

    Counting Minimum Weight Spanning Trees

    Andrei Z. Broder, Ernst W. Mayr

    J. Algorithms, vol. 24 (1997), pp. 171-176

  •  

    Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version)

    Andrei Z. Broder, Alan M. Frieze, Eli Upfal

    STOC (1997), pp. 531-539

  •  

    Syntactic Clustering of the Web

    Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, Geoffrey Zweig

    Computer Networks, vol. 29 (1997), pp. 1157-1166

  •  

    A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract)

    Andrei Z. Broder, Alan M. Frieze, Eli Upfal

    FOCS (1996), pp. 390-399

  •  

    An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs

    Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal

    SODA (1996), pp. 261-268

  •  

    Biased Random Walks

    Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips

    Combinatorica, vol. 16 (1996), pp. 1-18

  •  

    Dynamic Deflection Routing on Arrays (Preliminary Version)

    Andrei Z. Broder, Eli Upfal

    STOC (1996), pp. 348-355

  •  

    Pattern-based Compression of Text Images

    Andrei Z. Broder, Michael Mitzenmacher

    Data Compression Conference (1996), pp. 300-309

  •  

    Balanced Allocations for Tree-Like Inputs

    Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold

    Inf. Process. Lett., vol. 55 (1995), pp. 329-332

  •  

    The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height

    Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal

    Inf. Process. Lett., vol. 56 (1995), pp. 79-81

  •  

    Balanced allocations (extended abstract)

    Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal

    STOC (1994), pp. 593-602

  •  

    Existence and Construction of Edge-Disjoint Paths on Expander Graphs

    Andrei Z. Broder, Alan M. Frieze, Eli Upfal

    SIAM J. Comput., vol. 23 (1994), pp. 976-989

  •  

    Finding Hidden Hamiltonian Cycles

    Andrei Z. Broder, Alan M. Frieze, Eli Shamir

    Random Struct. Algorithms, vol. 5 (1994), pp. 395-411

  •  

    Near-perfect Token Distribution

    Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal

    Random Struct. Algorithms, vol. 5 (1994), pp. 559-572

  •  

    On the Problem of Approximating the Number of Bases of a Matroid

    Yossi Azar, Andrei Z. Broder, Alan M. Frieze

    Inf. Process. Lett., vol. 50 (1994), pp. 9-11

  •  

    On-Line Load Balancing

    Yossi Azar, Andrei Z. Broder, Anna R. Karlin

    Theor. Comput. Sci., vol. 130 (1994), pp. 73-84

  •  

    Optimal Construction of Edge-Disjoint Paths in Random Graphs

    Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal

    SODA (1994), pp. 603-612

  •  

    Trading Space for Time in Undirected s-t Connectivity

    Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal

    SIAM J. Comput., vol. 23 (1994), pp. 324-334

  •  

    On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas

    Andrei Z. Broder, Alan M. Frieze, Eli Upfal

    SODA (1993), pp. 322-330

  •  

    On-line Choice of On-line Algorithms

    Yossi Azar, Andrei Z. Broder, Mark S. Manasse

    SODA (1993), pp. 432-440

  •  

    Biased Random Walks

    Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips

    STOC (1992), pp. 1-9

  •  

    Existence and Construction of Edge Disjoint Paths on Expander Graphs

    Andrei Z. Broder, Alan M. Frieze, Eli Upfal

    STOC (1992), pp. 140-149

  •  

    Near-perfect Token Distribution

    Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal

    ICALP (1992), pp. 308-317

  •  

    On-line Load Balancing (Extended Abstract)

    Yossi Azar, Andrei Z. Broder, Anna R. Karlin

    FOCS (1992), pp. 218-225

  •  

    Finding Hidden Hamiltonian Cycles (Extended Abstract)

    Andrei Z. Broder, Alan M. Frieze, Eli Shamir

    STOC (1991), pp. 182-189

  •  

    On the Parallel Complexity of Evaluating Game Trees

    Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal

    SODA (1991), pp. 404-413

  •  

    Multilevel Adaptive Hashing

    Andrei Z. Broder, Anna R. Karlin

    SODA (1990), pp. 43-53

  •  

    The Cost Distribution of Clustering in Random Probing

    Béla Bollobás, Andrei Z. Broder, István Simon

    J. ACM, vol. 37 (1990), pp. 224-237

  •  

    Generating Random Spanning Trees

    Andrei Z. Broder

    FOCS (1989), pp. 442-447

  •  

    Trading Space for Time in Undirected s-t Connectivity

    Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal

    STOC (1989), pp. 543-549

  •  

    Bounds on the Cover Time (Preliminary Version)

    Andrei Z. Broder, Anna R. Karlin

    FOCS (1988), pp. 479-487

  •  

    Errata to "How hard is to marry at random? (On the approximation of the permanent)"

    Andrei Z. Broder

    STOC (1988), pp. 551

  •  

    On Generating Solved Instances of Computational Problems

    Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra

    CRYPTO (1988), pp. 297-310

  •  

    Efficient Fault-Tolerant Routings in Networks

    Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons

    Inf. Comput., vol. 75 (1987), pp. 52-64

  •  

    On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)

    Andrei Z. Broder, Eli Shamir

    FOCS (1987), pp. 286-294

  •  

    How hard is to marry at random? (On the approximation of the permanent)

    Andrei Z. Broder

    STOC (1986), pp. 50-58

  •  

    A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract)

    Andrei Z. Broder

    PODC (1985), pp. 136-148

  •  

    Placing Tiles in the Plane

    Andrei Z. Broder, Barbara Simons

    FODO (1985), pp. 207-223

  •  

    Efficient Fault Tolerant Routings in Networks

    Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons

    STOC (1984), pp. 536-541

  •  

    Flipping coins in many pockets (Byzantine agreement on uniformly random values)

    Andrei Z. Broder, Danny Dolev

    FOCS (1984), pp. 157-170

  •  

    The r-Stirling numbers

    Andrei Z. Broder

    Discrete Mathematics, vol. 49 (1984), pp. 241-259