A
Andrei Z. Broder
Researcher at Google
Publications - 241
Citations - 28441
Andrei Z. Broder is an academic researcher from Google. The author has contributed to research in topics: Web search query & Web page. The author has an hindex of 67, co-authored 241 publications receiving 27310 citations. Previous affiliations of Andrei Z. Broder include AmeriCorps VISTA & IBM.
Papers
More filters
Book ChapterDOI
Two counting problems solved via string encodings
TL;DR: The common feature of the two problems presented in this paper is the use of bijective string encodings to solve counting questions.
Patent
System and Method to Facilitate Mapping and Storage of Data Within One or More Data Taxonomies
TL;DR: In this article, a system and method to facilitate mapping and storage of data within one or more data taxonomies is described, where content information is received over a network and analyzed to determine at least one theme representing subject matter related to the content information.
Proceedings Article
Errata to "How hard is to marry at random? (On the approximation of the permanent)".
Book ChapterDOI
A general expression for abelian identities
Abstract: Publisher Summary This chapter presents a general explicit expression for the Abelian identities, for all p, q ≥0, using similar word counting arguments. A mapping is a function from a set into itself. The graph of a mapping f is a directed graph where every node has outdegree one. It consists of a collection of directed trees with their roots linked into directed loops. The elements that are part of a loop are called recurrent . The restriction of f to the recurrent elements is a permutation of these elements. The end of a cycle is signalled by a new left-to-right maximum. FF-encoding is a permutation of the trivial encoding. It is a 1–1 correspondence because it can be reversed.