Jump to Content
Ziv Bar-Yossef

Ziv Bar-Yossef

Ziv is VP of Engineering at Google. He's responsible for some of Google's Search Vertical products. In his past, Ziv has been doing research in Theoretical Computer Science, Information Theory and Web Search & Data Mining. His main areas of interest were data stream algorithms, communication complexity, sampling algorithms & complexity, and search engine measurements. See Ziv's publications in his Google Scholar profile. Ziv co-founded the ACM WSDM conference. Prior to Google, Ziv was an Assistant Professor at the Technion's Department of Electrical Engineering, a Research Staff Member at IBM Almaden, and a Graduate Student Researcher at U.C. Berkeley. Ziv holds a PhD in Computer Science from U.C Berkeley and BS and MS from the Hebrew University in Jerusalem.
Authored Publications
Google Publications
Other Publications
Sort By
  • Title
  • Title, descending
  • Year
  • Year, descending
    Context-sensitive query auto-completion
    Naama Kraus
    Proceedings of the 20th International Conference on World Wide Web (WWW) (2011), pp. 107-116
    Preview
    Efficient Search Engine Measurements
    Maxim Gurevich
    ACM Transactions on the Web, vol. 5, no. 4 (2011), pp. 18
    Preview
    Do not crawl in the DUST: Different URLs with similar text
    Idit Keidar
    Uri Schonfeld
    ACM Transactions on the Web, vol. 3 (2009), pp. 3
    Preview
    Estimating the ImpressionRank of Web Pages
    Maxim Gurevich
    Proceedings of the 18th International Conference on World Wide Web (WWW) (2009), pp. 41-50
    Preview
    RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks
    Roy Friedman
    Gabi Kliot
    ACM Transactions on Computer Systems, vol. 26 (2008), pp. 1-66
    Preview
    Mining Search Engine Query Logs via Suggestion Sampling
    Maxim Gurevich
    Proceedings of the VLDB Endowment (2008), pp. 54-65
    Preview
    Local Approximation of PageRank and Reverse PageRank
    Li-Tal Mashiach
    Proceedings of the 17th ACM Conference on Information and Knowledge Management (CIKM) (2008), pp. 279-288
    Preview
    Random sampling from a search engine's index
    Maxim Gurevich
    Journal of the ACM, vol. 55 (2008)
    Preview
    The Space Complexity of Processing XML Twig Queries over Indexed Documents
    Mirit Shalem
    Proceedings of the 24th International Conference on Data Engineering (ICDE) (2008), pp. 824-832
    Preview
    Cluster Ranking with an Application to Mining Mailbox Networks
    Ido Guy
    Ronny Lempel
    Yoelle S. Maarek
    Vladimir Soroka
    ICDM (2006), pp. 63-74
    Preview
    Index Coding with Side Information
    Yitzhak Birk
    T. S. Jayram
    Tomer Kol
    IEEE Transactions on Information Theory, vol. 57, no. 3 (2011), pp. 1479-1494
    Exponential Separation of Quantum and Classical One-Way Communication Complexity
    T. S. Jayram
    Iordanis Kerenidis
    SIAM Journal on Computing, vol. 38 (2008), pp. 366-384
    Cluster Ranking with an Application to Mining Mailbox Networks
    Ido Guy
    Ronny Lempel
    Yoelle Maarek
    Vladimir Soroka
    Knowledge and Information Systems, vol. 14 (2008), pp. 101-139
    On the memory requirements of XPath evaluation over XML streams
    Marcus Fontoura
    Vanja Josifovski
    J. of Computer and System Sciences, vol. 73, no.3 (2007), pp. 391-441
    RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks
    Roy Friedman
    Gabriel Kliot
    MobiHoc (2006), pp. 238-249
    Random sampling from a search engine's index
    Maxim Gurevich
    WWW (2006), pp. 367-376
    Do not crawl in the DUST: different URLs with similar text
    Uri Schonfeld
    Idit Keidar
    WWW (2006), pp. 1015-1016
    Index Coding with Side Information
    Yitzhak Birk
    T. S. Jayram
    Tomer Kol
    FOCS (2006), pp. 197-206
    Buffering in query evaluation over XML streams
    Marcus Fontoura
    Vanja Josifovski
    PODS (2005), pp. 216-227
    On the Memory Requirements of XPath Evaluation over XML Streams
    Marcus Fontoura
    Vanja Josifovski
    PODS (2004), pp. 177-188
    Sic transit gloria telae: towards an understanding of the web's decay
    Exponential separation of quantum and classical one-way communication complexity
    T. S. Jayram
    Iordanis Kerenidis
    STOC (2004), pp. 128-137
    The Sketching Complexity of Pattern Matching
    T. S. Jayram
    Robert Krauthgamer
    Ravi Kumar
    APPROX-RANDOM (2004), pp. 261-272
    Approximating Edit Distance Efficiently
    T. S. Jayram
    Robert Krauthgamer
    Ravi Kumar
    FOCS (2004), pp. 550-559
    An information statistics approach to data stream and communication complexity
    T. S. Jayram
    Ravi Kumar
    D. Sivakumar
    J. Comput. Syst. Sci., vol. 68 (2004), pp. 702-732
    Sampling lower bounds via information theory
    STOC (2003), pp. 335-344
    Streaming Computation of Combinatorial Objects
    Luca Trevisan
    Omer Reingold
    Ronen Shaltiel
    IEEE Conference on Computational Complexity (2002), pp. 165-174
    Template detection via data mining and its applications
    Sridhar Rajagopalan
    WWW (2002), pp. 580-591
    Counting Distinct Elements in a Data Stream
    T. S. Jayram
    Ravi Kumar
    D. Sivakumar
    Luca Trevisan
    RANDOM (2002), pp. 1-10
    Information Theory Methods in Communication Complexity
    T. S. Jayram
    Ravi Kumar
    D. Sivakumar
    IEEE Conference on Computational Complexity (2002), pp. 93-102
    Reductions in streaming algorithms, with an application to counting triangles in graphs
    Ravi Kumar
    D. Sivakumar
    SODA (2002), pp. 623-632
    An Information Statistics Approach to Data Stream and Communication Complexity
    T. S. Jayram
    Ravi Kumar
    D. Sivakumar
    FOCS (2002), pp. 209-218
    Incentive-compatible online auctions for digital goods
    Kirsten Hildrum
    Felix Wu
    SODA (2002), pp. 964-970
    Sampling algorithms: lower bounds and applications
    Ravi Kumar
    D. Sivakumar
    STOC (2001), pp. 266-275
    Approximating Aggregate Queries about Web Pages via Random Walks
    Alexander Berg
    Steve Chien
    Jittat Fakcharoenphol
    Dror Weitz
    VLDB (2000), pp. 535-544
    Deterministic Amplification of Space-Bounded Probabilistic Algorithms
    Oded Goldreich
    Avi Wigderson
    IEEE Conference on Computational Complexity (1999), pp. 188-
    Querying Semantically Tagged Documents on the World-Wide Web
    Yaron Kanza
    Yakov A. Kogan
    Werner Nutt
    Yehoshua Sagiv
    NGITS (1999), pp. 2-19
    Pointer Jumping Requires Concurrent Read
    Noam Nisan
    STOC (1997), pp. 549-558