Andrei Z. Broder

Andrei Z. Broder is a person.

• See: MinHash.

---

---

References

• Google Scholar Author Page: https://scholar.google.com/citations?user=7b858c0AAAAJ&oi=sra
• https://research.google.com/pubs/AndreiBroder.html

2004

• (Broder & Mitzenmacher, 2004) ⇒ Andrei Z. Broder, and Michael Mitzenmacher. (2004). “Network Applications of Bloom Filters: A Survey.” Internet mathematics 1, no. 4

2002

• (Broder, 2002) ⇒ Andrei Z. Broder. (2002). “A Taxonomy of Web Search.” In: ACM Sigir forum, vol. 36, no. 2, pp. 3-10 . ACM,

2000

• (Broder, 2000) ⇒ Andrei Z. Broder. (2000). “Identifying and Filtering Near-duplicate Documents.” In: Annual Symposium on Combinatorial Pattern Matching, pp. 1-10 . Springer, Berlin, Heidelberg,
• (Broder et al., 2000a) ⇒ Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wiener. (2000). “Graph Structure in the Web.” Computer networks 33, no. 1-6
• (Broder et al., 2000b) ⇒ Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. (2000). “Min-wise Independent Permutations.” Journal of Computer and System Sciences 60, no. 3
• (Fan et al., 2000) ⇒ Li Fan, Pei Cao, Jussara Almeida, and Andrei Z. Broder. (2000). “Summary Cache: A Scalable Wide-area Web Cache Sharing Protocol.” IEEE / ACM transactions on networking 8, no. 3

1997

• (Broder, 1997) ⇒ Andrei Z. Broder. (1997). “On the Resemblance and Containment of Documents.” In: Compression and Complexity of Sequences

---