| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Andrei Z. Broder 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 Andrei Z. Broder: Keynote Address - exploring, modeling, and using the web graph. SIGIR 2003 : 1 Andrei Z. Broder, Marc Najork , Janet L. Wiener : Efficient URL caching for world wide web crawling. WWW 2003 : 679-689 Andrei Z. Broder, Moses Charikar , Michael Mitzenmacher : A derandomization using min-wise independent permutations. J. Discrete Algorithms 1 (1): 11-20 (2003) Andrei Z. Broder, Michael Mitzenmacher : Optmial plans for aggregation. PODC 2002 : 144-152 Andrei Z. Broder, Michael Mitzenmacher : Using Multiple Hash Functions to Improve IP Lookups. INFOCOM 2001 : 1454-1463 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) Andrei Z. Broder, Michael Mitzenmacher : Completeness and robustness properties of min-wise independent permutations. Random Structures and Algorithms 18 (1): 18-30 (2001) Andrei Z. Broder: Identifying and Filtering Near-Duplicate Documents. CPM 2000 : 1-10 Andrei Z. Broder: Min-wise Independent Permutations: Theory and Practice. ICALP 2000 : 808 Andrei Z. Broder: Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science. ICALP Satellite Workshops 2000 : 1-2 Andrei Z. Broder, Uriel Feige : Min-Wise versus linear independence (extended abstract). SODA 2000 : 147-154 Andrei Z. Broder, Robert Krauthgamer , Michael Mitzenmacher : Improved classification via connectivity information. SODA 2000 : 576-585 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) 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) 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) Andrei Z. Broder, Moses Charikar , Alan M. Frieze , Michael Mitzenmacher : Min-Wise Independent Permutations. J. Comput. Syst. Sci. 60 (3): 630-659 (2000) 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) Andrei Z. Broder, Michael Mitzenmacher : Completeness and Robustness Properties of Min-Wise Independent Permutations. RANDOM-APPROX 1999 : 1-10 Andrei Z. Broder, Michael Mitzenmacher , Laurent Moll : Unscrambling Address Lines. SODA 1999 : 870-871 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) Andrei Z. Broder, Alan M. Frieze , Eli Upfal : Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Structures and Algorithms 14 (1): 87-109 (1999) Yossi Azar , Andrei Z. Broder, Anna R. Karlin , Eli Upfal : Balanced Allocations. SIAM J. Comput. 29 (1): 180-200 (1999) Andrei Z. Broder, Monika Rauch Henzinger : Information Retrieval on the Web. FOCS 1998 : 6 Andrei Z. Broder, Alan M. Frieze , Eli Upfal : Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN 1998 : 273-281 Andrei Z. Broder, Moses Charikar , Michael Mitzenmacher : A Derandomization Using Min-Wise Independent Permutations. RANDOM 1998 : 15-24 Li Fan , Pei Cao , Jussara A. Almeida , Andrei Z. Broder: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. SIGCOMM 1998 : 254-265 Andrei Z. Broder, Moses Charikar , Alan M. Frieze , Michael Mitzenmacher : Min-Wise Independent Permutations (Extended Abstract). STOC 1998 : 327-336 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) 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) 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) 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 Andrei Z. Broder, Steven C. Glassman , Mark S. Manasse , Geoffrey Zweig : Syntactic Clustering of the Web. Computer Networks 29 (8-13): 1157-1166 (1997) Andrei Z. Broder, Ernst W. Mayr : Counting Minimum Weight Spanning Trees. J. Algorithms 24 (1): 171-176 (1997) Andrei Z. Broder, Michael Mitzenmacher : Pattern-based Compression of Text Images. Data Compression Conference 1996 : 300-309 Andrei Z. Broder, Alan M. Frieze , Eli Upfal : A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS 1996 : 390-399 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 Andrei Z. Broder, Eli Upfal : Dynamic Deflection Routing on Arrays (Preliminary Version). STOC 1996 : 348-355 Yossi Azar , Andrei Z. Broder, Anna R. Karlin , Nathan Linial , Steven Phillips : Biased Random Walks. Combinatorica 16 (1): 1-18 (1996) 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) 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) Andrei Z. Broder, Alan M. Frieze , Stephen Suen , Eli Upfal : Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA 1994 : 603-612 Yossi Azar , Andrei Z. Broder, Anna R. Karlin , Eli Upfal : Balanced allocations (extended abstract). STOC 1994 : 593-602 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) Andrei Z. Broder, Alan M. Frieze , Eli Shamir : Finding Hidden Hamiltonian Cycles. Random Structures and Algorithms 5 (3): 395-411 (1994) Andrei Z. Broder, Alan M. Frieze , Eli Shamir , Eli Upfal : Near-perfect Token Distribution. Random Structures and Algorithms 5 (4): 559-572 (1994) 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) 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) Yossi Azar , Andrei Z. Broder, Anna R. Karlin : On-Line Load Balancing. Theor. Comput. Sci. 130 (1): 73-84 (1994) Andrei Z. Broder, Alan M. Frieze , Eli Upfal : On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993 : 322-330 Yossi Azar , Andrei Z. Broder, Mark S. Manasse : On-line Choice of On-line Algorithms. SODA 1993 : 432-440 Yossi Azar , Andrei Z. Broder, Anna R. Karlin : On-line Load Balancing (Extended Abstract) FOCS 1992 : 218-225 Andrei Z. Broder, Alan M. Frieze , Eli Shamir , Eli Upfal : Near-perfect Token Distribution. ICALP 1992 : 308-317 Yossi Azar , Andrei Z. Broder, Anna R. Karlin , Nathan Linial , Steven Phillips : Biased Random Walks STOC 1992 : 1-9 Andrei Z. Broder, Alan M. Frieze , Eli Upfal : Existence and Construction of Edge Disjoint Paths on Expander Graphs STOC 1992 : 140-149 Andrei Z. Broder, Anna R. Karlin , Prabhakar Raghavan , Eli Upfal : On the Parallel Complexity of Evaluating Game Trees. SODA 1991 : 404-413 Andrei Z. Broder, Alan M. Frieze , Eli Shamir : Finding Hidden Hamiltonian Cycles (Extended Abstract) STOC 1991 : 182-189 Andrei Z. Broder, Anna R. Karlin : Multilevel Adaptive Hashing. SODA 1990 : 43-53 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) Andrei Z. Broder: Generating Random Spanning Trees FOCS 1989 : 442-447 Andrei Z. Broder, Anna R. Karlin , Prabhakar Raghavan , Eli Upfal : Trading Space for Time in Undirected s-t Connectivity STOC 1989 : 543-549 Martín Abadi , Eric Allender , Andrei Z. Broder, Joan Feigenbaum , Lane A. Hemachandra : On Generating Solved Instances of Computational Problems. CRYPTO 1988 : 297-310 Andrei Z. Broder, Anna R. Karlin : Bounds on the Cover Time (Preliminary Version) FOCS 1988 : 479-487 Andrei Z. Broder: Errata to ``How hard is to marry at random? (On the approximation of the permanent)'' STOC 1988 : 551 Andrei Z. Broder, Eli Shamir : On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) FOCS 1987 : 286-294 Andrei Z. Broder, Danny Dolev , Michael J. Fischer , Barbara Simons : Efficient Fault-Tolerant Routings in Networks Inf. Comput. 75 (1): 52-64 (1987) Andrei Z. Broder: How hard is to marry at random? (On the approximation of the permanent) STOC 1986 : 50-58 Andrei Z. Broder, Barbara Simons : Placing Tiles in the Plane. FODO 1985 : 207-223 Andrei Z. Broder: A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract). PODC 1985 : 136-148 Andrei Z. Broder, Danny Dolev : Flipping coins in many pockets (Byzantine agreement on uniformly random values) FOCS 1984 : 157-170 Andrei Z. Broder, Danny Dolev , Michael J. Fischer , Barbara Simons : Efficient Fault Tolerant Routings in Networks STOC 1984 : 536-541 1 [ 10 ] 2 [ 10 ] 3 [ 45 ] 4 [ 56 ] 5 [ 18 ] [ 20 ] [ 21 ] [ 23 ] [ 28 ] [ 29 ] [ 33 ] [ 49 ] 6 [ 42 ] [ 43 ] [ 51 ] [ 54 ] [ 57 ] 7 [ 13 ] 8 [ 45 ] [ 56 ] 9 [ 71 ] 10 [ 44 ] [ 46 ] [ 55 ] [ 68 ] 11 [ 54 ] [ 57 ] 12 [ 1 ] [ 2 ] [ 6 ] 13 [ 31 ] 14 [ 45 ] [ 56 ] 15 [ 60 ] 16 [ 10 ] 17 [ 1 ] [ 6 ] 18 [ 15 ] [ 17 ] [ 19 ] [ 22 ] [ 24 ] [ 26 ] [ 27 ] [ 28 ] [ 30 ] [ 31 ] [ 32 ] [ 35 ] [ 36 ] [ 40 ] [ 41 ] [ 44 ] [ 47 ] [ 50 ] [ 55 ] [ 65 ] 19 [ 39 ] 20 [ 10 ] 21 [ 42 ] [ 48 ] [ 54 ] [ 57 ] 22 [ 71 ] 23 [ 9 ] [ 11 ] [ 14 ] [ 16 ] [ 18 ] [ 20 ] [ 23 ] [ 25 ] [ 29 ] [ 33 ] [ 49 ] 24 [ 59 ] 25 [ 42 ] 26 [ 58 ] 27 [ 18 ] [ 33 ] 28 [ 32 ] 29 [ 58 ] 30 [ 21 ] [ 39 ] 31 [ 38 ] 32 [ 37 ] [ 44 ] [ 46 ] [ 52 ] [ 53 ] [ 55 ] [ 59 ] [ 64 ] [ 66 ] [ 67 ] [ 68 ] 33 [ 52 ] 34 [ 69 ] 35 [ 18 ] [ 32 ] [ 33 ] 36 [ 11 ] [ 16 ] [ 25 ] [ 31 ] [ 58 ] 37 [ 58 ] 38 [ 32 ] 39 [ 7 ] [ 15 ] [ 19 ] [ 26 ] [ 27 ] 40 [ 13 ] 41 [ 1 ] [ 4 ] [ 6 ] 42 [ 71 ] 43 [ 58 ] 44 [ 30 ] [ 35 ] [ 41 ] 45 [ 58 ] 46 [ 11 ] [ 16 ] [ 17 ] [ 19 ] [ 22 ] [ 24 ] [ 25 ] [ 26 ] [ 29 ] [ 30 ] [ 31 ] [ 34 ] [ 35 ] [ 36 ] [ 40 ] [ 41 ] [ 47 ] [ 49 ] [ 50 ] [ 65 ] 47 [ 42 ] 48 [ 58 ] [ 69 ] 49 [ 71 ] 50 [ 39 ]  ©2004 Association for Computing Machinery |
