The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Andrei Z. Broder: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Krishna Bharat, Andrei Z. Broder
    A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines. [Citation Graph (2, 0)][DBLP]
    Computer Networks, 1998, v:30, n:1-7, pp:379-388 [Journal]
  2. Krishna Bharat, Andrei Z. Broder, Monika Rauch Henzinger, Puneet Kumar, Suresh Venkatasubramanian
    The Connectivity Server: Fast Access to Linkage Information on the Web. [Citation Graph (2, 0)][DBLP]
    Computer Networks, 1998, v:30, n:1-7, pp:469-477 [Journal]
  3. Li Fan, Pei Cao, Jussara M. Almeida, Andrei Z. Broder
    Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. [Citation Graph (1, 0)][DBLP]
    SIGCOMM, 1998, pp:254-265 [Conf]
  4. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. [Citation Graph (1, 0)][DBLP]
    SODA, 1993, pp:322-330 [Conf]
  5. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
    Balanced allocations (extended abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1994, pp:593-602 [Conf]
  6. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
    Min-Wise Independent Permutations (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1998, pp:327-336 [Conf]
  7. Krishna Bharat, Andrei Z. Broder
    Mirror, Mirror on the Web: A Study of Host Pairs with Replicated Content. [Citation Graph (1, 0)][DBLP]
    Computer Networks, 1999, v:31, n:11-16, pp:1579-1590 [Journal]
  8. Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, Geoffrey Zweig
    Syntactic Clustering of the Web. [Citation Graph (1, 0)][DBLP]
    Computer Networks, 1997, v:29, n:8-13, pp:1157-1166 [Journal]
  9. Yossi Azar, Andrei Z. Broder, Anna R. Karlin
    On-Line Load Balancing. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:73-84 [Journal]
  10. Andrei Z. Broder
    Invited Talk: The Many Wonders of the Web Graph. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:154-154 [Conf]
  11. Andrei Z. Broder, David Carmel, Michael Herscovici, Aya Soffer, Jason Y. Zien
    Efficient query evaluation using a two-level retrieval process. [Citation Graph (0, 0)][DBLP]
    CIKM, 2003, pp:426-434 [Conf]
  12. Aris Anagnostopoulos, Andrei Z. Broder, Kunal Punera
    Effective and efficient classification on a search-engine model. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:208-217 [Conf]
  13. Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Rajeev Motwani, Shubha U. Nabar, Rina Panigrahy, Andrew Tomkins, Ying Xu 0002
    Estimating corpus size via queries. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:594-603 [Conf]
  14. Andrei Z. Broder
    Identifying and Filtering Near-Duplicate Documents. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:1-10 [Conf]
  15. Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra
    On Generating Solved Instances of Computational Problems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:297-310 [Conf]
  16. Andrei Z. Broder, Michael Mitzenmacher
    Pattern-based Compression of Text Images. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1996, pp:300-309 [Conf]
  17. Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger
    A Comparison of Techniques to Find Mirrored Hosts on the WWW. [Citation Graph (0, 0)][DBLP]
    WOWS, 1999, pp:2-12 [Conf]
  18. Andrei Z. Broder
    The Next Generation Web Search and the Demise of the Classic IR Model. [Citation Graph (0, 0)][DBLP]
    ECIR, 2007, pp:1- [Conf]
  19. Andrei Z. Broder, Nadav Eiron, Marcus Fontoura, Michael Herscovici, Ronny Lempel, John McPherson, Runping Qi, Eugene J. Shekita
    Indexing Shared Content in Information Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:313-330 [Conf]
  20. Yossi Azar, Andrei Z. Broder, Anna R. Karlin
    On-line Load Balancing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:218-225 [Conf]
  21. Andrei Z. Broder
    Generating Random Spanning Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:442-447 [Conf]
  22. Andrei Z. Broder, Danny Dolev
    Flipping coins in many pockets (Byzantine agreement on uniformly random values) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:157-170 [Conf]
  23. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:390-399 [Conf]
  24. Andrei Z. Broder, Monika Rauch Henzinger
    Information Retrieval on the Web. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:6- [Conf]
  25. Andrei Z. Broder, Anna R. Karlin
    Bounds on the Cover Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:479-487 [Conf]
  26. Andrei Z. Broder, Eli Shamir
    On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:286-294 [Conf]
  27. Andrei Z. Broder, Barbara Simons
    Placing Tiles in the Plane. [Citation Graph (0, 0)][DBLP]
    FODO, 1985, pp:207-223 [Conf]
  28. Andrei Z. Broder
    Min-wise Independent Permutations: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:808- [Conf]
  29. Andrei Z. Broder
    Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:1-2 [Conf]
  30. Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
    Near-perfect Token Distribution. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:308-317 [Conf]
  31. Andrei Z. Broder, Michael Mitzenmacher
    Using Multiple Hash Functions to Improve IP Lookups. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1454-1463 [Conf]
  32. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Dynamic Packet Routing on Arrays with Bounded Buffers. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:273-281 [Conf]
  33. Andrei Z. Broder
    The Future of Web Search: From Information Retrieval to Information Supply. [Citation Graph (0, 0)][DBLP]
    NGITS, 2006, pp:362- [Conf]
  34. Andrei Z. Broder
    A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:136-148 [Conf]
  35. Andrei Z. Broder, Michael Mitzenmacher
    Optmial plans for aggregation. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:144-152 [Conf]
  36. Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
    A Derandomization Using Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:15-24 [Conf]
  37. Andrei Z. Broder, Michael Mitzenmacher
    Completeness and Robustness Properties of Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:1-10 [Conf]
  38. Andrei Z. Broder
    Keynote Address - exploring, modeling, and using the web graph. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2003, pp:1- [Conf]
  39. Yossi Azar, Andrei Z. Broder, Mark S. Manasse
    On-line Choice of On-line Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:432-440 [Conf]
  40. Andrei Z. Broder, Uriel Feige
    Min-Wise versus linear independence (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:147-154 [Conf]
  41. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    Optimal Construction of Edge-Disjoint Paths in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:603-612 [Conf]
  42. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:261-268 [Conf]
  43. Andrei Z. Broder, Anna R. Karlin
    Multilevel Adaptive Hashing. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:43-53 [Conf]
  44. Andrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher
    Improved classification via connectivity information. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:576-585 [Conf]
  45. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
    On the Parallel Complexity of Evaluating Game Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:404-413 [Conf]
  46. Andrei Z. Broder, Michael Mitzenmacher
    Multidimensional balanced allocations. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:195-196 [Conf]
  47. Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll
    Unscrambling Address Lines. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:870-871 [Conf]
  48. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips
    Biased Random Walks [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:1-9 [Conf]
  49. Andrei Z. Broder
    How hard is to marry at random? (On the approximation of the permanent) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:50-58 [Conf]
  50. Andrei Z. Broder
    Errata to ``How hard is to marry at random? (On the approximation of the permanent)'' [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:551- [Conf]
  51. Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
    Efficient Fault Tolerant Routings in Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:536-541 [Conf]
  52. Andrei Z. Broder, Alan M. Frieze, Eli Shamir
    Finding Hidden Hamiltonian Cycles (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:182-189 [Conf]
  53. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Existence and Construction of Edge Disjoint Paths on Expander Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:140-149 [Conf]
  54. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:531-539 [Conf]
  55. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
    Trading Space for Time in Undirected s-t Connectivity [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:543-549 [Conf]
  56. Andrei Z. Broder, Eli Upfal
    Dynamic Deflection Routing on Arrays (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:348-355 [Conf]
  57. Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andrew Tomkins
    Sic transit gloria telae: towards an understanding of the web's decay. [Citation Graph (0, 0)][DBLP]
    WWW, 2004, pp:328-337 [Conf]
  58. Aris Anagnostopoulos, Andrei Z. Broder, David Carmel
    Sampling search-engine results. [Citation Graph (0, 0)][DBLP]
    WWW, 2005, pp:245-256 [Conf]
  59. Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Jan O. Pedersen
    Efficient pagerank approximation via graph aggregation. [Citation Graph (0, 0)][DBLP]
    WWW (Alternate Track Papers & Posters), 2004, pp:484-485 [Conf]
  60. Andrei Z. Broder, Yoëlle S. Maarek, Krishna Bharat, Susan T. Dumais, Steve Papa, Jan O. Pedersen, Prabhakar Raghavan
    Current trends in the integration of searching and browsing. [Citation Graph (0, 0)][DBLP]
    WWW (Special interest tracks and posters), 2005, pp:793- [Conf]
  61. Andrei Z. Broder, Marc Najork, Janet L. Wiener
    Efficient URL caching for world wide web crawling. [Citation Graph (0, 0)][DBLP]
    WWW, 2003, pp:679-689 [Conf]
  62. Byron Dom, Krishna Bharat, Andrei Z. Broder, Marc Najork, Jan O. Pedersen, Yoshinobu Tonomura
    How search engines shape the web. [Citation Graph (0, 0)][DBLP]
    WWW (Special interest tracks and posters), 2005, pp:879- [Conf]
  63. Ling Liu, Andrei Z. Broder, Dieter Fensel, Carole A. Goble, Calton Pu
    Querying the past, present and future: where we are and where we will be. [Citation Graph (0, 0)][DBLP]
    WWW (Special interest tracks and posters), 2005, pp:798- [Conf]
  64. Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, Janet L. Wiener
    Graph structure in the Web. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2000, v:33, n:1-6, pp:309-320 [Journal]
  65. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips
    Biased Random Walks. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:1-18 [Journal]
  66. Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger
    A Comparison of Techniques to Find Mirrored Hosts on the WWW. [Citation Graph (0, 0)][DBLP]
    IEEE Data Eng. Bull., 2000, v:23, n:4, pp:21-26 [Journal]
  67. Andrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
    Efficient Fault-Tolerant Routings in Networks [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:75, n:1, pp:52-64 [Journal]
  68. Andrei Z. Broder, Arthur C. Ciccolo
    Towards the next generation of enterprise search technology. [Citation Graph (0, 0)][DBLP]
    IBM Systems Journal, 2004, v:43, n:3, pp:451-454 [Journal]
  69. Yossi Azar, Andrei Z. Broder, Alan M. Frieze
    On the Problem of Approximating the Number of Bases of a Matroid. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:9-11 [Journal]
  70. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:2, pp:79-81 [Journal]
  71. Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold
    Balanced Allocations for Tree-Like Inputs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:6, pp:329-332 [Journal]
  72. Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Jan O. Pedersen
    Efficient PageRank approximation via graph aggregation. [Citation Graph (0, 0)][DBLP]
    Inf. Retr., 2006, v:9, n:2, pp:123-138 [Journal]
  73. Béla Bollobás, Andrei Z. Broder, István Simon
    The Cost Distribution of Clustering in Random Probing [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:2, pp:224-237 [Journal]
  74. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    A general approach to dynamic packet routing with bounded buffers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:2, pp:324-349 [Journal]
  75. Andrei Z. Broder, Ernst W. Mayr
    Counting Minimum Weight Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:171-176 [Journal]
  76. Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger
    A comparison of techniques to find mirrored hosts on the WWW. [Citation Graph (0, 0)][DBLP]
    JASIS, 2000, v:51, n:12, pp:1114-1122 [Journal]
  77. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
    Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:630-659 [Journal]
  78. Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
    A derandomization using min-wise independent permutations. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:11-20 [Journal]
  79. Andrei Z. Broder, Alan M. Frieze, Eli Shamir
    Finding Hidden Hamiltonian Cycles. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:3, pp:395-411 [Journal]
  80. Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
    Near-perfect Token Distribution. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:4, pp:559-572 [Journal]
  81. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:1, pp:87-109 [Journal]
  82. Andrei Z. Broder, Michael Mitzenmacher
    Completeness and robustness properties of min-wise independent permutations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:1, pp:18-30 [Journal]
  83. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
    Balanced Allocations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:180-200 [Journal]
  84. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    Optimal Construction of Edge-Disjoint Paths in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:541-573 [Journal]
  85. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Existence and Construction of Edge-Disjoint Paths on Expander Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:976-989 [Journal]
  86. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
    Trading Space for Time in Undirected s-t Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:324-334 [Journal]
  87. Andrei Z. Broder
    A taxonomy of web search. [Citation Graph (0, 0)][DBLP]
    SIGIR Forum, 2002, v:36, n:2, pp:3-10 [Journal]
  88. Li Fan, Pei Cao, Jussara M. Almeida, Andrei Z. Broder
    Summary cache: a scalable wide-area web cache sharing protocol. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2000, v:8, n:3, pp:281-293 [Journal]
  89. Aris Anagnostopoulos, Andrei Z. Broder, David Carmel
    Sampling Search-Engine Results. [Citation Graph (0, 0)][DBLP]
    World Wide Web, 2006, v:9, n:4, pp:397-429 [Journal]
  90. Maria-Florina Balcan, Andrei Z. Broder, Tong Zhang
    Margin Based Active Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:35-50 [Conf]
  91. Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrabarti, Dejan Diklic, Vanja Josifovski, Mayssam Sayyadian
    Estimating rates of rare events at multiple resolutions. [Citation Graph (0, 0)][DBLP]
    KDD, 2007, pp:16-25 [Conf]
  92. Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Lance Riedel
    A semantic approach to contextual advertising. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2007, pp:559-566 [Conf]
  93. Andrei Z. Broder, Marcus Fontoura, Evgeniy Gabrilovich, Amruta Joshi, Vanja Josifovski, Tong Zhang
    Robust classification of rare queries using web knowledge. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2007, pp:231-238 [Conf]
  94. Andrei Z. Broder
    The r-Stirling numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:3, pp:241-259 [Journal]

  95. Algorithmic Challenge in Online Advertising. [Citation Graph (, )][DBLP]


  96. Just-in-time contextual advertising. [Citation Graph (, )][DBLP]


  97. To swing or not to swing: learning when (not) to advertise. [Citation Graph (, )][DBLP]


  98. Search advertising using web relevance feedback. [Citation Graph (, )][DBLP]


  99. A note on search based forecasting of ad volume in contextual advertising. [Citation Graph (, )][DBLP]


  100. Information extraction meets relation databases. [Citation Graph (, )][DBLP]


  101. What happens after an ad click?: quantifying the impact of landing pages in web advertising. [Citation Graph (, )][DBLP]


  102. Cross-lingual query classification: a preliminary study. [Citation Graph (, )][DBLP]


  103. Optimizing relevance and revenue in ad search: a query substitution approach. [Citation Graph (, )][DBLP]


  104. Context transfer in search advertising. [Citation Graph (, )][DBLP]


  105. Information retrieval challenges in computational advertising. [Citation Graph (, )][DBLP]


  106. Computational advertising. [Citation Graph (, )][DBLP]


  107. The hiring problem and Lake Wobegon strategies. [Citation Graph (, )][DBLP]


  108. Modelling and Mining of Networked Information Spaces. [Citation Graph (, )][DBLP]


  109. Workshop on Algorithms and Models for the Web Graph. [Citation Graph (, )][DBLP]


  110. A search-based method for forecasting ad impression in contextual advertising. [Citation Graph (, )][DBLP]


  111. Online expansion of rare queries for sponsored search. [Citation Graph (, )][DBLP]


  112. Nearest-neighbor caching for content-match applications. [Citation Graph (, )][DBLP]


  113. Competing for users' attention: on the interplay between organic and sponsored search results. [Citation Graph (, )][DBLP]


  114. Search is dead!: long live search. [Citation Graph (, )][DBLP]


  115. Computational advertising and recommender systems. [Citation Graph (, )][DBLP]


  116. Anatomy of the long tail: ordinary people with extraordinary tastes. [Citation Graph (, )][DBLP]


  117. Cross-language query classification using web search for exogenous knowledge. [Citation Graph (, )][DBLP]


  118. Automatic generation of bid phrases for online advertising. [Citation Graph (, )][DBLP]


  119. Using XML to Query XML - From Theory to Practice. [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.048secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002