default search action
Andrei Z. Broder
Person information
- award (2020): Paris Kanellakis Award
- award (2012): Paris Kanellakis Award
- affiliation: Google, Mountain View, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c106]Andrei Z. Broder
:
Delphic Costs and Benefits in Web Search: A Utilitarian and Historical Analysis. WSDM 2024: 1 - [e9]Andrei Z. Broder, Tami Tamir:
12th International Conference on Fun with Algorithms, FUN 2024, June 4-8, 2024, Island of La Maddalena, Sardinia, Italy. LIPIcs 291, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-314-0 [contents] - 2023
- [i2]Andrei Z. Broder, Preston McAfee:
Delphic Costs and Benefits in Web Search: A utilitarian and historical analysis. CoRR abs/2308.07525 (2023) - 2020
- [i1]Andrei Z. Broder, Ravi Kumar:
A Note on Double Pooling Tests. CoRR abs/2004.01684 (2020)
2010 – 2019
- 2018
- [c105]Yu Sun, Lluis Garcia Pueyo, James B. Wendt
Learning Effective Embeddings for Machine Generated Emails with Applications to Email Category Prediction. IEEE BigData 2018: 1846-1855 - [c104]Andrei Z. Broder:
A Call to Arms: Embrace Assistive AI Systems! WSDM 2018: 1 - [e8]Alfredo Cuzzocrea, James Allan, Norman W. Paton, Divesh Srivastava, Rakesh Agrawal, Andrei Z. Broder, Mohammed J. Zaki, K. Selçuk Candan, Alexandros Labrinidis, Assaf Schuster, Haixun Wang:
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy, October 22-26, 2018. ACM 2018, ISBN 978-1-4503-6014-2 [contents] - [r2]Vanja Josifovski, Andrei Z. Broder:
Web Advertising. Encyclopedia of Database Systems (2nd ed.) 2018 - 2017
- [c103]Aston Zhang, Lluis Garcia Pueyo, James B. Wendt
Email Category Prediction. WWW (Companion Volume) 2017: 495-503 - 2016
- [c102]Andrei Z. Broder:
A Personal Perspective and Retrospective on Web Search Technology. CIKM 2016: 1149 - 2015
- [c101]Andrei Z. Broder, Lada A. Adamic, Michael J. Franklin, Maarten de Rijke, Eric P. Xing, Kai Yu:
Big Data: New Paradigm or "Sound and Fury, Signifying Nothing"? WSDM 2015: 5-6 - 2014
- [c100]Andrei Z. Broder, Lluis Garcia Pueyo, Vanja Josifovski, Sergei Vassilvitskii, Srihari Venkatesan:
Scalable K-Means by ranked retrieval. WSDM 2014: 233-242 - [e7]Chin-Wan Chung, Andrei Z. Broder, Kyuseok Shim, Torsten Suel:
23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014. ACM 2014, ISBN 978-1-4503-2744-2 [contents] - [e6]Chin-Wan Chung, Andrei Z. Broder, Kyuseok Shim, Torsten Suel:
23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume. ACM 2014, ISBN 978-1-4503-2745-9 [contents] - 2012
- [c99]Andrei Z. Broder:
IR paradigms in computational advertising. SIGIR 2012: 1019 - [e5]Tsau Young Lin, Xiaohua Hu, Zhaohui Wu, Arbee L. P. Chen, Andrei Z. Broder, Howard Ho, Shuliang Wang:
2012 IEEE International Conference on Granular Computing, GrC 2012, Hangzhou, China, August 11-13, 2012. IEEE Computer Society 2012, ISBN 978-1-4673-2310-9 [contents] - 2011
- [j40]Aris Anagnostopoulos
Web Page Summarization for Just-in-Time Contextual Advertising. ACM Trans. Intell. Syst. Technol. 3(1): 14:1-14:32 (2011) - [c98]Andrei Z. Broder, Evgeniy Gabrilovich
Information retrieval challenges in computational advertising. CIKM 2011: 2611-2612 - [c97]Andrei Z. Broder:
An introduction to online targeted advertising: principles, implementation, controversies. IUI 2011: 103-104 - [c96]Andrei Z. Broder:
Highly Dimensional Problems in Computational Advertising. ECML/PKDD (1) 2011: 5 - [c95]Andrei Z. Broder, Vanja Josifovski, Jayavel Shanmugasundaram:
Introduction to display advertising: a half-day tutorial. WSDM 2011: 3-4 - [c94]Andrei Z. Broder, Evgeniy Gabrilovich
Bid generation for advanced match in sponsored search. WSDM 2011: 515-524 - [c93]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
- [c92]Andrei Z. Broder, Evgeniy Gabrilovich
Exploiting site-level information to improve web search. CIKM 2010: 1393-1396 - [c91]Ricardo Baeza-Yates
The New Frontier of Web Search Technology: Seven Challenges. SeCO Workshop 2010: 3-9 - [c90]Andrei Z. Broder, Evgeniy Gabrilovich, Vanja Josifovski:
Information retrieval challenges in computational advertising. SIGIR 2010: 908 - [c89]Andrei Z. Broder:
The Anatomy of the Long Tail of Consumer Demand. WAW 2010: 1 - [c88]Sharad Goel, Andrei Z. Broder, Evgeniy Gabrilovich
Anatomy of the long tail: ordinary people with extraordinary tastes. WSDM 2010: 201-210 - [c87]Sujith Ravi, Andrei Z. Broder, Evgeniy Gabrilovich
Automatic generation of bid phrases for online advertising. WSDM 2010: 341-350 - [c86]Cristian Danescu-Niculescu-Mizil, Andrei Z. Broder, Evgeniy Gabrilovich
Competing for users' attention: on the interplay between organic and sponsored search results. WWW 2010: 291-300 - [c85]Andrei Z. Broder, Elizabeth F. Churchill, Marti A. Hearst, Barney Pell, Prabhakar Raghavan
Search is dead!: long live search. WWW 2010: 1337-1338 - [e4]Xiaohua Hu, Tsau Young Lin, Vijay V. Raghavan, Jerzy W. Grzymala-Busse, Qing Liu, Andrei Z. Broder:
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 [contents]
2000 – 2009
- 2009
- [j39]Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal
The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput. 39(4): 1233-1255 (2009) - [j38]Evgeniy Gabrilovich
Classifying search queries using the Web as a source of knowledge. ACM Trans. Web 3(2): 5:1-5:28 (2009) - [c84]Andrei Z. Broder:
Algorithmic Challenge in Online Advertising. AAIM 2009: 1 - [c83]Hila Becker, Andrei Z. Broder, Evgeniy Gabrilovich
What happens after an ad click?: quantifying the impact of landing pages in web advertising. CIKM 2009: 57-66 - [c82]Davood Rafiei, Andrei Z. Broder, Edward Y. Chang, Patrick Pantel:
Information extraction meets relation databases. CIKM 2009: 897 - [c81]Hila Becker, Andrei Z. Broder, Evgeniy Gabrilovich
Context transfer in search advertising. SIGIR 2009: 656-657 - [c80]Xuerui Wang, Andrei Z. Broder, Evgeniy Gabrilovich
Cross-language query classification using web search for exogenous knowledge. WSDM 2009: 74-83 - [c79]Sandeep Pandey, Andrei Z. Broder, Flavio Chierichetti, Vanja Josifovski, Ravi Kumar, Sergei Vassilvitskii:
Nearest-neighbor caching for content-match applications. WWW 2009: 441-450 - [c78]Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski:
A search-based method for forecasting ad impression in contextual advertising. WWW 2009: 491-500 - [c77]Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovich
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
- [j37]Aris Anagnostopoulos
Effective and efficient classification on a search-engine model. Knowl. Inf. Syst. 16(2): 129-154 (2008) - [j36]Einat Amitay, Andrei Z. Broder:
Introduction to special issue on query log analysis: Technology and ethics. ACM Trans. Web 2(4): 18:1-18:2 (2008) - [c76]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 - [c75]Xuerui Wang, Andrei Z. Broder, Evgeniy Gabrilovich
Cross-lingual query classification: a preliminary study. CIKM-iNEWS 2008: 101-104 - [c74]Andrei Z. Broder, Massimiliano Ciaramita, Marcus Fontoura, Evgeniy Gabrilovich
To swing or not to swing: learning when (not) to advertise. CIKM 2008: 1003-1012 - [c73]Andrei Z. Broder, Peter Ciccolo, Marcus Fontoura, Evgeniy Gabrilovich
Search advertising using web relevance feedback. CIKM 2008: 1013-1022 - [c72]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 - [c71]Andrei Z. Broder:
Computational advertising and recommender systems. RecSys 2008: 1-2 - [c70]Filip Radlinski, Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovich
Optimizing relevance and revenue in ad search: a query substitution approach. SIGIR 2008: 403-410 - [c69]Andrei Z. Broder:
Computational advertising. SODA 2008: 992 - [c68]Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii:
The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193 - [e3]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
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 [contents] - [e2]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, ISBN 978-1-59593-927-2 [contents] - 2007
- [c67]Aris Anagnostopoulos
Just-in-time contextual advertising. CIKM 2007: 331-340 - [c66]Maria-Florina Balcan, Andrei Z. Broder, Tong Zhang:
Margin Based Active Learning. COLT 2007: 35-50 - [c65]Andrei Z. Broder:
The Next Generation Web Search and the Demise of the Classic IR Model. ECIR 2007: 1 - [c64]Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrabarti
Estimating rates of rare events at multiple resolutions. KDD 2007: 16-25 - [c63]Andrei Z. Broder, Marcus Fontoura, Evgeniy Gabrilovich
Robust classification of rare queries using web knowledge. SIGIR 2007: 231-238 - [c62]Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Lance Riedel:
A semantic approach to contextual advertising. SIGIR 2007: 559-566 - 2006
- [j35]Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Jan O. Pedersen:
Efficient PageRank approximation via graph aggregation. Inf. Retr. 9(2): 123-138 (2006) - [j34]Aris Anagnostopoulos
Sampling Search-Engine Results. World Wide Web 9(4): 397-429 (2006) - [c61]Aris Anagnostopoulos
Effective and efficient classification on a search-engine model. CIKM 2006: 208-217 - [c60]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 - [c59]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 - [c58]Andrei Z. Broder:
The Future of Web Search: From Information Retrieval to Information Supply. NGITS 2006: 362 - [c57]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
Modelling and Mining of Networked Information Spaces. WAW 2006: 1-17 - [c56]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
Workshop on Algorithms and Models for the Web Graph. WAW 2006: 18-23 - 2005
- [c55]Andrei Z. Broder, Michael Mitzenmacher:
Multidimensional balanced allocations. SODA 2005: 195-196 - [c54]Aris Anagnostopoulos
Sampling search-engine results. WWW 2005: 245-256 - [c53]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 - [c52]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 - [c51]Byron Dom, Krishna Bharat, Andrei Z. Broder, Marc Najork
How search engines shape the web. WWW (Special interest tracks and posters) 2005: 879 - 2004
- [j33]Andrei Z. Broder, Arthur C. Ciccolo:
Towards the next generation of enterprise search technology. IBM Syst. J. 43(3): 451-454 (2004) - [c50]Andrei Z. Broder:
Invited Talk: The Many Wonders of the Web Graph. CAAN 2004: 154-154 - [c49]Andrei Z. Broder, Yoëlle S. Maarek, Matan Mandelbrod, Yosi Mass:
Using XML to Query XML - From Theory to Practice. RIAO 2004: 582-594 - [c48]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 - [c47]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
- [j32]Andrei Z. Broder, Michael Mitzenmacher:
Survey: Network Applications of Bloom Filters: A Survey. Internet Math. 1(4): 485-509 (2003) - [j31]Andrei Z. Broder, Moses Charikar
A derandomization using min-wise independent permutations. J. Discrete Algorithms 1(1): 11-20 (2003) - [c46]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 - [c45]Andrei Z. Broder:
Keynote Address - exploring, modeling, and using the web graph. SIGIR 2003: 1 - [c44]Andrei Z. Broder, Marc Najork
Efficient URL caching for world wide web crawling. WWW 2003: 679-689 - 2002
- [j30]Andrei Z. Broder:
A taxonomy of web search. SIGIR Forum 36(2): 3-10 (2002) - [c43]Andrei Z. Broder, Michael Mitzenmacher:
Optmial plans for aggregation. PODC 2002: 144-152 - 2001
- [j29]Andrei Z. Broder, Alan M. Frieze
A general approach to dynamic packet routing with bounded buffers. J. ACM 48(2): 324-349 (2001) - [j28]Andrei Z. Broder, Michael Mitzenmacher:
Completeness and robustness properties of min-wise independent permutations. Random Struct. Algorithms 18(1): 18-30 (2001) - [c42]Andrei Z. Broder, Michael Mitzenmacher:
Using Multiple Hash Functions to Improve IP Lookups. INFOCOM 2001: 1454-1463 - 2000
- [j27]Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan
Graph structure in the Web. Comput. Networks 33(1-6): 309-320 (2000) - [j26]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) - [j25]Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger:
A comparison of techniques to find mirrored hosts on the WWW. J. Am. Soc. Inf. Sci. 51(12): 1114-1122 (2000) - [j24]Andrei Z. Broder, Moses Charikar
Min-Wise Independent Permutations. J. Comput. Syst. Sci. 60(3): 630-659 (2000) - [j23]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) - [c41]Andrei Z. Broder:
Identifying and Filtering Near-Duplicate Documents. CPM 2000: 1-10 - [c40]Andrei Z. Broder:
Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science. ICALP Satellite Workshops 2000: 1-2 - [c39]Andrei Z. Broder:
Min-wise Independent Permutations: Theory and Practice. ICALP 2000: 808 - [c38]Andrei Z. Broder, Uriel Feige:
Min-Wise versus linear independence (extended abstract). SODA 2000: 147-154 - [c37]Andrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher:
Improved classification via connectivity information. SODA 2000: 576-585 - [e1]José D. P. Rolim, Andrei Z. Broder, Andrea Corradini, Roberto Gorrieri, Reiko Heckel, Juraj Hromkovic, Ugo Vaccaro, J. B. Wells:
ICALP Workshops 2000, Proceedings of the Satelite Workshops of the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, July 9-15, 2000. Carleton Scientific, Waterloo, Ontario, Canada 2000, ISBN 1-894145-07-0 [contents]
1990 – 1999
- 1999
- [j22]Krishna Bharat, Andrei Z. Broder:
Mirror, Mirror on the Web: A Study of Host Pairs with Replicated Content. Comput. Networks 31(11-16): 1579-1590 (1999) - [j21]Andrei Z. Broder, Alan M. Frieze
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Struct. Algorithms 14(1): 87-109 (1999) - [j20]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999) - [c36]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 - [c35]Andrei Z. Broder, Michael Mitzenmacher:
Completeness and Robustness Properties of Min-Wise Independent Permutations. RANDOM-APPROX 1999: 1-10 - [c34]Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll:
Unscrambling Address Lines. SODA 1999: 870-871 - 1998
- [j19]Krishna Bharat, Andrei Z. Broder:
A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines. Comput. Networks 30(1-7): 379-388 (1998) - [j18]Krishna Bharat, Andrei Z. Broder, Monika Henzinger, Puneet Kumar, Suresh Venkatasubramanian:
The Connectivity Server: Fast Access to Linkage Information on the Web. Comput. Networks 30(1-7): 469-477 (1998) - [j17]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) - [c33]Andrei Z. Broder, Monika Rauch Henzinger:
Information Retrieval on the Web. FOCS 1998: 6 - [c32]Andrei Z. Broder, Alan M. Frieze
Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN 1998: 273-281 - [c31]Andrei Z. Broder, Moses Charikar
A Derandomization Using Min-Wise Independent Permutations. RANDOM 1998: 15-24 - [c30]Li Fan, Pei Cao, Jussara M. Almeida, Andrei Z. Broder:
Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. SIGCOMM 1998: 254-265 - [c29]Andrei Z. Broder, Moses Charikar
Min-Wise Independent Permutations (Extended Abstract). STOC 1998: 327-336 - 1997
- [j16]Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, Geoffrey Zweig:
Syntactic Clustering of the Web. Comput. Networks 29(8-13): 1157-1166 (1997) - [j15]Andrei Z. Broder, Ernst W. Mayr:
Counting Minimum Weight Spanning Trees. J. Algorithms 24(1): 171-176 (1997) - [c28]Andrei Z. Broder:
On the resemblance and containment of documents. SEQUENCES 1997: 21-29 - [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
- [j14]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven J. Phillips:
Biased Random Walks. Comb. 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
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]Andrei Z. Broder, Eli Upfal
Dynamic Deflection Routing on Arrays (Preliminary Version). STOC 1996: 348-355 - 1995
- [j13]Andrei Z. Broder, Alan M. Frieze
Balanced Allocations for Tree-Like Inputs. Inf. Process. Lett. 55(6): 329-332 (1995) - [j12]Andrei Z. Broder, Martin E. Dyer
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. 56(2): 79-81 (1995) - 1994
- [j11]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) - [j10]Andrei Z. Broder, Alan M. Frieze
Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms 5(3): 395-411 (1994) - [j9]Andrei Z. Broder, Alan M. Frieze
Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994) - [j8]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) - [j7]Andrei Z. Broder, Alan M. Frieze
Existence and Construction of Edge-Disjoint Paths on Expander Graphs. SIAM J. Comput. 23(5): 976-989 (1994) - [j6]Yossi Azar
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 J. 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
- [j5]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]Andrei Z. Broder, Anna R. Karlin:
Multilevel Adaptive Hashing. SODA 1990: 43-53
1980 – 1989
- 1989
- [c11]Andrei Z. Broder:
Generating Random Spanning Trees. FOCS 1989: 442-447 - [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
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
- [j4]Andrei Z. Broder, Danny Dolev
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
- [b1]Andrei Z. Broder:
Weighted random mappings; properties and applications. Stanford University, USA, 1985 - [j3]Andrei Z. Broder, Alfred M. Bruckstein, Jack Koplowitz:
On the performance of edited nearest neighbor rules in high dimensions. IEEE Trans. Syst. Man Cybern. 15(1): 136-139 (1985) - [c4]Andrei Z. Broder, Barbara Simons:
Placing Tiles in the Plane. FODO 1985: 207-223 - [c3]Andrei Z. Broder:
A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract). PODC 1985: 136-148 - 1984
- [j2]Andrei Z. Broder:
The r-Stirling numbers. Discret. Math. 49(3): 241-259 (1984) - [j1]Andrei Z. Broder, Jorge Stolfi:
Pessimal algorithms and simplexity analysis. SIGACT News 16(3): 49-53 (1984) - [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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: