| 2012 | ||
|---|---|---|
| c98 | ||
| 2011 | ||
| j38 | Aris Anagnostopoulos, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Lance Riedel: Web Page Summarization for Just-in-Time Contextual Advertising. ACM TIST 3(1): 14 (2011) | |
| c97 | Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski: Information retrieval challenges in computational advertising. CIKM 2011: 2611-2612 | |
| c96 | Andrei Z. Broder: An introduction to online targeted advertising: principles, implementation, controversies. IUI 2011: 103-104 | |
| c95 | ||
| c94 | Andrei Z. Broder, Vanja Josifovski, Jayavel Shanmugasundaram: Introduction to display advertising: a half-day tutorial. WSDM 2011: 3-4 | |
| c93 | Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, George Mavromatis, Alex J. Smola: Bid generation for advanced match in sponsored search. WSDM 2011: 515-524 | |
| c92 | Andrei Z. Broder, Shirshanka Das, Marcus Fontoura, Bhaskar Ghosh, Vanja Josifovski, Jayavel Shanmugasundaram, Sergei Vassilvitskii: Efficiently evaluating graph constraints in content-based publish/subscribe. WWW 2011: 497-506 | |
| 2010 | ||
| c91 | Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, George Mavromatis, Donald Metzler, Jane Wang: Exploiting site-level information to improve web search. CIKM 2010: 1393-1396 | |
| c90 | Ricardo A. Baeza-Yates, Andrei Z. Broder, Yoëlle S. Maarek: The New Frontier of Web Search Technology: Seven Challenges. SeCO Workshop 2010: 3-9 | |
| c89 | Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski: Information retrieval challenges in computational advertising. SIGIR 2010: 908 | |
| c88 | ||
| c87 | Sharad Goel, Andrei Z. Broder, Evgeniy Gabrilovich, Bo Pang: Anatomy of the long tail: ordinary people with extraordinary tastes. WSDM 2010: 201-210 | |
| c86 | Sujith Ravi, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Sandeep Pandey, Bo Pang: Automatic generation of bid phrases for online advertising. WSDM 2010: 341-350 | |
| c85 | Cristian Danescu-Niculescu-Mizil, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang: Competing for users' attention: on the interplay between organic and sponsored search results. WWW 2010: 291-300 | |
| c84 | Andrei Z. Broder, Elizabeth F. Churchill, Marti Hearst, Barney Pell, Prabhakar Raghavan, Andrew Tomkins: Search is dead!: long live search. WWW 2010: 1337-1338 | |
| e3 | Xiaohua Hu, Tsau Young Lin, Vijay V. Raghavan, Jerzy W. Grzymala-Busse, Qing Liu, Andrei Z. Broder (Eds.): 2010 IEEE International Conference on Granular Computing, GrC 2010, San Jose, California, USA, 14-16 August 2010. IEEE Computer Society 2010, isbn 978-0-7695-4161-7 | |
| 2009 | ||
| j37 | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput. 39(4): 1233-1255 (2009) | |
| j36 | 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) | |
| c83 | ||
| c82 | Hila Becker, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang: What happens after an ad click?: quantifying the impact of landing pages in web advertising. CIKM 2009: 57-66 | |
| c81 | Davood Rafiei, Andrei Z. Broder, Edward Y. Chang, Patrick Pantel: Information extraction meets relation databases. CIKM 2009: 897 | |
| c80 | Hila Becker, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang: Context transfer in search advertising. SIGIR 2009: 656-657 | |
| c79 | 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 | |
| c78 | Sandeep Pandey, Andrei Z. Broder, Flavio Chierichetti, Vanja Josifovski, Ravi Kumar, Sergei Vassilvitskii: Nearest-neighbor caching for content-match applications. WWW 2009: 441-450 | |
| c77 | Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski: A search-based method for forecasting ad impression in contextual advertising. WWW 2009: 491-500 | |
| c76 | 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 | |
| r1 | Vanja Josifovski, Andrei Z. Broder: Web Advertising. Encyclopedia of Database Systems 2009: 3457-3459 | |
| 2008 | ||
| j35 | Aris Anagnostopoulos, Andrei Z. Broder, Kunal Punera: Effective and efficient classification on a search-engine model. Knowl. Inf. Syst. 16(2): 129-154 (2008) | |
| j34 | Einat Amitay, Andrei Z. Broder: Introduction to special issue on query log analysis: Technology and ethics. TWEB 2(4) (2008) | |
| c75 | Sihem Amer-Yahia, Andrei Z. Broder, Alban Galland: Reviewing the Reviewers: Characterizing Biases and Competencies using Socially Meaningful Attributes. AAAI Spring Symposium: Social Information Processing 2008: 1-6 | |
| c74 | Xuerui Wang, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Bo Pang: Cross-lingual query classification: a preliminary study. CIKM-iNEWS 2008: 101-104 | |
| c73 | 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 | |
| c72 | Andrei Z. Broder, Peter Ciccolo, Marcus Fontoura, Evgeniy Gabrilovich, Vanja Josifovski, Lance Riedel: Search advertising using web relevance feedback. CIKM 2008: 1013-1022 | |
| c71 | 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 | |
| c70 | ||
| c69 | 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 | |
| c68 | ||
| c67 | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193 | |
| e2 | William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen, Evangelos E. Milios (Eds.): Algorithms and Models for the Web-Graph, Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers. Lecture Notes in Computer Science 4936, Springer 2008, isbn 978-3-540-78807-2 | |
| e1 | Marc Najork, Andrei Z. Broder, Soumen Chakrabarti (Eds.): Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008. ACM 2008 | |
| 2007 | ||
| c66 | Aris Anagnostopoulos, Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski, Lance Riedel: Just-in-time contextual advertising. CIKM 2007: 331-340 | |
| c65 | ||
| c64 | Andrei Z. Broder: The Next Generation Web Search and the Demise of the Classic IR Model. ECIR 2007: 1 | |
| c63 | 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 | |
| c62 | 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 | |
| c61 | Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Lance Riedel: A semantic approach to contextual advertising. SIGIR 2007: 559-566 | |
| 2006 | ||
| j33 | Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Jan O. Pedersen: Efficient PageRank approximation via graph aggregation. Inf. Retr. 9(2): 123-138 (2006) | |
| j32 | Aris Anagnostopoulos, Andrei Z. Broder, David Carmel: Sampling Search-Engine Results. World Wide Web 9(4): 397-429 (2006) | |
| c60 | Aris Anagnostopoulos, Andrei Z. Broder, Kunal Punera: Effective and efficient classification on a search-engine model. CIKM 2006: 208-217 | |
| c59 | 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 | |
| c58 | 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 | |
| c57 | Andrei Z. Broder: The Future of Web Search: From Information Retrieval to Information Supply. NGITS 2006: 362 | |
| c56 | William Aiello, Andrei Z. Broder, Jeannette Janssen, Evangelos E. Milios: Modelling and Mining of Networked Information Spaces. WAW 2006: 1-17 | |
| c55 | William Aiello, Andrei Z. Broder, Jeannette Janssen, Evangelos E. Milios: Workshop on Algorithms and Models for the Web Graph. WAW 2006: 18-23 | |
| 2005 | ||
| c54 | ||
| c53 | Aris Anagnostopoulos, Andrei Z. Broder, David Carmel: Sampling search-engine results. WWW 2005: 245-256 | |
| c52 | 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 | |
| c51 | 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 | |
| c50 | 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 | ||
| j31 | Andrei Z. Broder, Arthur C. Ciccolo: Towards the next generation of enterprise search technology. IBM Systems Journal 43(3): 451-454 (2004) | |
| c49 | ||
| c48 | Andrei Z. Broder, Yoëlle S. Maarek, Matan Mandelbrod, Yosi Mass: Using XML to Query XML - From Theory to Practice. RIAO 2004: 582-594 | |
| c47 | 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 | |
| c46 | Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Jan O. Pedersen: Efficient pagerank approximation via graph aggregation. WWW (Alternate Track Papers & Posters) 2004: 484-485 | |
| 2003 | ||
| j30 | Andrei Z. Broder, Michael Mitzenmacher: Survey: Network Applications of Bloom Filters: A Survey. Internet Mathematics 1(4): 485-509 (2003) | |
| j29 | Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher: A derandomization using min-wise independent permutations. J. Discrete Algorithms 1(1): 11-20 (2003) | |
| c45 | 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 | |
| c44 | ||
| c43 | Andrei Z. Broder, Marc Najork, Janet L. Wiener: Efficient URL caching for world wide web crawling. WWW 2003: 679-689 | |
| 2002 | ||
| j28 | ||
| c42 | ||
| 2001 | ||
| j27 | 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) | |
| j26 | Andrei Z. Broder, Michael Mitzenmacher: Completeness and robustness properties of min-wise independent permutations. Random Struct. Algorithms 18(1): 18-30 (2001) | |
| c41 | Andrei Z. Broder, Michael Mitzenmacher: Using Multiple Hash Functions to Improve IP Lookups. INFOCOM 2001: 1454-1463 | |
| 2000 | ||
| j25 | 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) | |
| j24 | 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) | |
| j23 | 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) | |
| j22 | Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher: Min-Wise Independent Permutations. J. Comput. Syst. Sci. 60(3): 630-659 (2000) | |
| j21 | 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) | |
| c40 | ||
| c39 | Andrei Z. Broder: Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science. ICALP Satellite Workshops 2000: 1-2 | |
| c38 | ||
| c37 | Andrei Z. Broder, Uriel Feige: Min-Wise versus linear independence (extended abstract). SODA 2000: 147-154 | |
| c36 | Andrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher: Improved classification via connectivity information. SODA 2000: 576-585 | |
| 1999 | ||
| j20 | 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) | |
| j19 | 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) | |
| j18 | Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999) | |
| c35 | 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 | |
| c34 | Andrei Z. Broder, Michael Mitzenmacher: Completeness and Robustness Properties of Min-Wise Independent Permutations. RANDOM-APPROX 1999: 1-10 | |
| c33 | Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll: Unscrambling Address Lines. SODA 1999: 870-871 | |
| 1998 | ||
| j17 | 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) | |
| j16 | 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) | |
| j15 | 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) | |
| c32 | ||
| c31 | Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN 1998: 273-281 | |
| c30 | Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher: A Derandomization Using Min-Wise Independent Permutations. RANDOM 1998: 15-24 | |
| c29 | Li Fan, Pei Cao, Jussara M. Almeida, Andrei Z. Broder: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. SIGCOMM 1998: 254-265 | |
| c28 | Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher: Min-Wise Independent Permutations (Extended Abstract). STOC 1998: 327-336 | |
| 1997 | ||
| j14 | Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, Geoffrey Zweig: Syntactic Clustering of the Web. Computer Networks 29(8-13): 1157-1166 (1997) | |
| j13 | Andrei Z. Broder, Ernst W. Mayr: Counting Minimum Weight Spanning Trees. J. Algorithms 24(1): 171-176 (1997) | |
| c27 | 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 | |
| 1996 | ||
| j12 | Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips: Biased Random Walks. Combinatorica 16(1): 1-18 (1996) | |
| c26 | Andrei Z. Broder, Michael Mitzenmacher: Pattern-based Compression of Text Images. Data Compression Conference 1996: 300-309 | |
| c25 | Andrei Z. Broder, Alan M. Frieze, Eli Upfal: A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS 1996: 390-399 | |
| c24 | 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 | |
| c23 | ||
| 1995 | ||
| j11 | 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) | |
| j10 | 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 | ||
| j9 | 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) | |
| j8 | Andrei Z. Broder, Alan M. Frieze, Eli Shamir: Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms 5(3): 395-411 (1994) | |
| j7 | Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal: Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994) | |
| j6 | 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) | |
| j5 | 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) | |
| j4 | Yossi Azar, Andrei Z. Broder, Anna R. Karlin: On-Line Load Balancing. Theor. Comput. Sci. 130(1): 73-84 (1994) | |
| c22 | Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal: Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA 1994: 603-612 | |
| c21 | Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced allocations (extended abstract). STOC 1994: 593-602 | |
| 1993 | ||
| c20 | Andrei Z. Broder, Alan M. Frieze, Eli Upfal: On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993: 322-330 | |
| c19 | Yossi Azar, Andrei Z. Broder, Mark S. Manasse: On-line Choice of On-line Algorithms. SODA 1993: 432-440 | |
| 1992 | ||
| c18 | Yossi Azar, Andrei Z. Broder, Anna R. Karlin: On-line Load Balancing (Extended Abstract). FOCS 1992: 218-225 | |
| c17 | Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal: Near-perfect Token Distribution. ICALP 1992: 308-317 | |
| c16 | Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips: Biased Random Walks. STOC 1992: 1-9 | |
| c15 | Andrei Z. Broder, Alan M. Frieze, Eli Upfal: Existence and Construction of Edge Disjoint Paths on Expander Graphs. STOC 1992: 140-149 | |
| 1991 | ||
| c14 | Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal: On the Parallel Complexity of Evaluating Game Trees. SODA 1991: 404-413 | |
| c13 | Andrei Z. Broder, Alan M. Frieze, Eli Shamir: Finding Hidden Hamiltonian Cycles (Extended Abstract). STOC 1991: 182-189 | |
| 1990 | ||
| j3 | 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) | |
| c12 | ||
| 1989 | ||
| c11 | ||
| c10 | Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal: Trading Space for Time in Undirected s-t Connectivity. STOC 1989: 543-549 | |
| 1988 | ||
| c9 | Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra: On Generating Solved Instances of Computational Problems. CRYPTO 1988: 297-310 | |
| c8 | Andrei Z. Broder, Anna R. Karlin: Bounds on the Cover Time (Preliminary Version). FOCS 1988: 479-487 | |
| c7 | Andrei Z. Broder: Errata to "How hard is to marry at random? (On the approximation of the permanent)". STOC 1988: 551 | |
| 1987 | ||
| j2 | Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons: Efficient Fault-Tolerant Routings in Networks. Inf. Comput. 75(1): 52-64 (1987) | |
| c6 | Andrei Z. Broder, Eli Shamir: On the Second Eigenvalue of Random Regular Graphs (Preliminary Version). FOCS 1987: 286-294 | |
| 1986 | ||
| c5 | Andrei Z. Broder: How hard is to marry at random? (On the approximation of the permanent). STOC 1986: 50-58 | |
| 1985 | ||
| c4 | ||
| c3 | Andrei Z. Broder: A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract). PODC 1985: 136-148 | |
| 1984 | ||
| j1 | ||
| c2 | Andrei Z. Broder, Danny Dolev: Flipping coins in many pockets (Byzantine agreement on uniformly random values). FOCS 1984: 157-170 | |
| c1 | Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons: Efficient Fault Tolerant Routings in Networks. STOC 1984: 536-541 | |
Colors in the list of coauthors
Last update Wed May 22 03:18:11 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page