Andrei Broder

Known as: Andrei Z. Broder, Broder 
Andrei Zary Broder (Hebrew: אנדרי זרי ברודר‎‎) is a Distinguished Scientist at Google. Previously he was a Research Fellow and Vice President of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1946-2017
0102019462016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Knowledge about the general graph structure of the World Wide Web is important for understanding the social mechanisms that… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from a search engine's index… (More)
  • figure 5
  • table 1
  • figure 7
  • figure 8
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Broder et al.'s [3] shingling algorithm and Charikar's [4] random projection based approach are considered "state-of-the-art… (More)
  • figure 1
  • table 1
  • table 2
  • table 4
  • table 3
Is this relevant?
2005
2005
decomposition (Smith et al., 1998), less is known about the interactions of substrate characteristics and microThe soluble… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We develop a theory in which the decision to pay dividends is driven by investor demand. Managers cater to investors by paying… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We give a space-efficient, one-pass algorithm for approximating the L1 difference Pi jai bij between two functions, when the… (More)
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Many dynamic resource allocation and on-line load balancing problems can be modeled by processes that sequentially allocate balls… (More)
  • table 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Learners rely on a combination of experience-independent and experience-dependent mechanisms to extract information from the… (More)
  • table 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The <italic>permanent</italic> of an <italic>n</italic> x <italic>n</italic> matrix <italic>A</italic> with 0-1 entries <italic>a… (More)
Is this relevant?