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
Context-sensitive query auto-completion
Preview
Naama Kraus
Proceedings of the 20th International Conference on World Wide Web (WWW) (2011), pp. 107-116
Estimating the ImpressionRank of Web Pages
Preview
Maxim Gurevich
Proceedings of the 18th International Conference on World Wide Web (WWW) (2009), pp. 41-50
The Space Complexity of Processing XML Twig Queries over Indexed Documents
Preview
Mirit Shalem
Proceedings of the 24th International Conference on Data Engineering (ICDE) (2008), pp. 824-832
RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks
Preview
Roy Friedman
Gabi Kliot
ACM Transactions on Computer Systems, vol. 26 (2008), pp. 1-66
Local Approximation of PageRank and Reverse PageRank
Preview
Li-Tal Mashiach
Proceedings of the 17th ACM Conference on Information and Knowledge Management (CIKM) (2008), pp. 279-288
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
Random sampling from a search engine's index
Index Coding with Side Information
RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks
Do not crawl in the DUST: different URLs with similar text
Buffering in query evaluation over XML streams
Exponential separation of quantum and classical one-way communication complexity
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
On the Memory Requirements of XPath Evaluation over XML Streams
The Sketching Complexity of Pattern Matching
Approximating Edit Distance Efficiently
Sic transit gloria telae: towards an understanding of the web's decay
Sampling lower bounds via information theory
STOC (2003), pp. 335-344
Reductions in streaming algorithms, with an application to counting triangles in graphs
Template detection via data mining and its applications
Streaming Computation of Combinatorial Objects
Luca Trevisan
Omer Reingold
Ronen Shaltiel
IEEE Conference on Computational Complexity (2002), pp. 165-174
Information Theory Methods in Communication Complexity
T. S. Jayram
Ravi Kumar
D. Sivakumar
IEEE Conference on Computational Complexity (2002), pp. 93-102
Incentive-compatible online auctions for digital goods
Counting Distinct Elements in a Data Stream
An Information Statistics Approach to Data Stream and Communication Complexity
Sampling algorithms: lower bounds and applications
Approximating Aggregate Queries about Web Pages via Random Walks
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
Pointer Jumping Requires Concurrent Read
