BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × China
1 × Italy
1 × Portugal
1 × Singapore
1 × The Netherlands
1 × United Kingdom
14 × USA
3 × Switzerland
4 × Canada
Collaborated with:
V.Josifovski E.Gabrilovich E.Upfal A.M.Frieze M.Fontoura L.Riedel A.R.Karlin E.Shamir A.Anagnostopoulos Y.Azar H.Becker B.Pang P.Ciccolo K.Punera D.Metzler D.Rafiei E.Y.Chang P.Pantel X.Wang M.Charikar M.Mitzenmacher P.Raghavan D.Dolev M.J.Fischer B.Simons D.Carmel M.Herscovici A.Soffer J.Y.Zien N.Linial S.Phillips G.Mavromatis J.Wang F.Radlinski D.Agarwal D.Chakrabarti D.Diklic M.Sayyadian A.Joshi T.Zhang M.Ciaramita V.Murdock V.Plachouras R.Kumar R.Motwani S.U.Nabar R.Panigrahy A.Tomkins Y.Xu
Talks about:
advertis (11) search (7) web (6) random (4) inform (4) comput (4) queri (4) use (4) contextu (3) approach (3)

Person: Andrei Z. Broder

DBLP DBLP: Broder:Andrei_Z=

Contributed to:

SIGIR 20122012
CIKM 20112011
CIKM 20102010
SIGIR 20102010
CIKM 20092009
SIGIR 20092009
CIKM 20082008
RecSys 20082008
SIGIR 20082008
CIKM 20072007
ECIR 20072007
KDD 20072007
SIGIR 20072007
CIKM 20062006
CIKM 20032003
SIGIR 20032003
ICALP 20002000
STOC 19981998
STOC 19971997
STOC 19961996
STOC 19941994
ICALP 19921992
STOC 19921992
STOC 19911991
STOC 19891989
STOC 19881988
STOC 19861986
STOC 19841984

Wrote 34 papers:

SIGIR-2012-Broder #information retrieval #paradigm
IR paradigms in computational advertising (AZB), p. 1019.
CIKM-2011-BroderGJ #challenge #information retrieval
Information retrieval challenges in computational advertising (AZB, EG, VJ), pp. 2611–2612.
CIKM-2010-BroderGJMMW #web
Exploiting site-level information to improve web search (AZB, EG, VJ, GM, DM, JW), pp. 1393–1396.
SIGIR-2010-BroderGJ #challenge #information retrieval
Information retrieval challenges in computational advertising (AZB, EG, VJ), p. 908.
CIKM-2009-BeckerBGJP #web #what
What happens after an ad click?: quantifying the impact of landing pages in web advertising (HB, AZB, EG, VJ, BP), pp. 57–66.
CIKM-2009-RafieiBCP #database #information management
Information extraction meets relation databases (DR, AZB, EYC, PP), p. 897.
Context transfer in search advertising (HB, AZB, EG, VJ, BP), pp. 656–657.
CIKM-2008-BroderCFGJMMP #learning
To swing or not to swing: learning when (not) to advertise (AZB, MC, MF, EG, VJ, DM, VM, VP), pp. 1003–1012.
CIKM-2008-BroderCFGJR #feedback #using #web
Search advertising using web relevance feedback (AZB, PC, MF, EG, VJ, LR), pp. 1013–1022.
A note on search based forecasting of ad volume in contextual advertising (XW, AZB, MF, VJ), pp. 1343–1344.
RecSys-2008-Broder #recommendation
Computational advertising and recommender systems (AZB), pp. 1–2.
SIGIR-2008-RadlinskiBCGJR #approach #optimisation #query
Optimizing relevance and revenue in ad search: a query substitution approach (FR, AZB, PC, EG, VJ, LR), pp. 403–410.
Just-in-time contextual advertising (AA, AZB, EG, VJ, LR), pp. 331–340.
ECIR-2007-Broder #generative #information retrieval #web
The Next Generation Web Search and the Demise of the Classic IR Model (AZB), p. 1.
KDD-2007-AgarwalBCDJS #multi
Estimating rates of rare events at multiple resolutions (DA, AZB, DC, DD, VJ, MS), pp. 16–25.
SIGIR-2007-BroderFGJJZ #classification #query #robust #using #web
Robust classification of rare queries using web knowledge (AZB, MF, EG, AJ, VJ, TZ), pp. 231–238.
SIGIR-2007-BroderFJR #approach #semantics
A semantic approach to contextual advertising (AZB, MF, VJ, LR), pp. 559–566.
CIKM-2006-AnagnostopoulosBP #classification #effectiveness #performance
Effective and efficient classification on a search-engine model (AA, AZB, KP), pp. 208–217.
CIKM-2006-BroderFJKMNPTX #corpus #query
Estimating corpus size via queries (AZB, MF, VJ, RK, RM, SUN, RP, AT, YX), pp. 594–603.
CIKM-2003-BroderCHSZ #evaluation #performance #process #query #retrieval #using
Efficient query evaluation using a two-level retrieval process (AZB, DC, MH, AS, JYZ), pp. 426–434.
SIGIR-2003-Broder #graph #modelling #using #web
Keynote Address — exploring, modeling, and using the web graph (AZB), p. 1.
ICALP-2000-Broder #independence #permutation #theory and practice
Min-wise Independent Permutations: Theory and Practice (AZB), p. 808.
STOC-1998-BroderCFM #independence #permutation
Min-Wise Independent Permutations (AZB, MC, AMF, MM), pp. 327–336.
STOC-1997-BroderFU #approach #graph #random
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (AZB, AMF, EU), pp. 531–539.
STOC-1996-BroderU #array
Dynamic Deflection Routing on Arrays (AZB, EU), pp. 348–355.
Balanced allocations (YA, AZB, ARK, EU), pp. 593–602.
Near-perfect Token Distribution (AZB, AMF, ES, EU), pp. 308–317.
STOC-1992-AzarBKLP #random
Biased Random Walks (YA, AZB, ARK, NL, SP), pp. 1–9.
STOC-1992-BroderFU #graph
Existence and Construction of Edge Disjoint Paths on Expander Graphs (AZB, AMF, EU), pp. 140–149.
Finding Hidden Hamiltonian Cycles (AZB, AMF, ES), pp. 182–189.
Trading Space for Time in Undirected s-t Connectivity (AZB, ARK, PR, EU), pp. 543–549.
STOC-1988-Broder #approximate #how #random
Errata to “How hard is to marry at random? (On the approximation of the permanent)” (AZB), p. 551.
STOC-1986-Broder #approximate #how #random
How hard is to marry at random? (On the approximation of the permanent) (AZB), pp. 50–58.
STOC-1984-BroderDFS #fault tolerance #network #performance
Efficient Fault Tolerant Routings in Networks (AZB, DD, MJF, BS), pp. 536–541.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.