Ziv Bar-Yossef

See his homepage.

Publications

• Do not crawl in the DUST: Different URLs with similar text, Ziv Bar-Yossef, Idit Keidar, Uri Schonfeld, ACM Transactions on the Web, vol. 3 (2009), pp. 3.

• Estimating the ImpressionRank of Web Pages, Ziv Bar-Yossef, Maxim Gurevich, Proceedings of the 18th International Conference on World Wide Web (WWW), 2009 (to appear).

• Local Approximation of PageRank and Reverse PageRank, Ziv Bar-Yossef, Li-Tal Mashiach, Proceedings of the 17th ACM Conference on Information and Knowledge Management (CIKM), 2008, pp. 279-288.

• Mining Search Engine Query Logs via Suggestion Sampling, Ziv Bar-Yossef, Maxim Gurevich, Proceedings of the VLDB Endowment, 2008, pp. 54-65.

• RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks, Ziv Bar-Yossef, Roy Friedman, Gabi Kliot, ACM Transactions on Computer Systems, vol. 26 (2008), pp. 1-66.

• Random sampling from a search engine's index, Ziv Bar-Yossef, Maxim Gurevich, Journal of the ACM, vol. 55 (2008).

• The Space Complexity of Processing XML Twig Queries over Indexed Documents, Mirit Shalem, Ziv Bar-Yossef, Proceedings of the 24th International Conference on Data Engineering (ICDE), 2008, pp. 824-832.

• Do Not Crawl in the DUST: Different URLs with Similar Text, Ziv Bar-Yossef, Idit Keidar, Uri Schonfeld, WWW, 2007, pp. 111-120.

• Efficient Search Engine Measurements, Ziv Bar-Yossef, Maxim Gurevich, WWW, 2007, pp. 401-410.

• Cluster Ranking with an Application to Mining Mailbox Networks, Ziv Bar-Yossef, Ido Guy, Ronny Lempel, Yoelle S. Maarek, Vladimir Soroka, ICDM, 2006, pp. 63-74.

Prior Publications

• Cluster Ranking with an Application to Mining Mailbox Networks, Ziv Bar-Yossef, Ido Guy, Ronny Lempel, Yoelle Maarek, Vladimir Soroka, Knowledge and Information Systems, vol. 14 (2008), pp. 101-139.

• Exponential Separation of Quantum and Classical One-Way Communication Complexity, Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis, SIAM Journal on Computing, vol. 38 (2008), pp. 366-384.

• Do not crawl in the DUST: different URLs with similar text, Uri Schonfeld, Ziv Bar-Yossef, Idit Keidar, WWW, 2006, pp. 1015-1016.

• Index Coding with Side Information, Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol, FOCS, 2006, pp. 197-206.

• RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks, Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot, MobiHoc, 2006, pp. 238-249.

• Random sampling from a search engine's index, Ziv Bar-Yossef, Maxim Gurevich, WWW, 2006, pp. 367-376.

• Buffering in query evaluation over XML streams, Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski, PODS, 2005, pp. 216-227.

• An information statistics approach to data stream and communication complexity, Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, J. Comput. Syst. Sci., vol. 68 (2004), pp. 702-732.

• Approximating Edit Distance Efficiently, Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar, FOCS, 2004, pp. 550-559.

• Exponential separation of quantum and classical one-way communication complexity, Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis, STOC, 2004, pp. 128-137.

• On the Memory Requirements of XPath Evaluation over XML Streams, Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski, PODS, 2004, pp. 177-188.

• Sic transit gloria telae: towards an understanding of the web's decay, Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andrew Tomkins, WWW, 2004, pp. 328-337.

• The Sketching Complexity of Pattern Matching, Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar, APPROX-RANDOM, 2004, pp. 261-272.

• Sampling lower bounds via information theory, Ziv Bar-Yossef, STOC, 2003, pp. 335-344.

• An Information Statistics Approach to Data Stream and Communication Complexity, Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, FOCS, 2002, pp. 209-218.

• Counting Distinct Elements in a Data Stream, Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan, RANDOM, 2002, pp. 1-10.

• Incentive-compatible online auctions for digital goods, Ziv Bar-Yossef, Kirsten Hildrum, Felix Wu, SODA, 2002, pp. 964-970.

• Information Theory Methods in Communication Complexity, Ziv Bar-Yossef, 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, Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar, SODA, 2002, pp. 623-632.

• Streaming Computation of Combinatorial Objects, Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel, IEEE Conference on Computational Complexity, 2002, pp. 165-174.

• Template detection via data mining and its applications, Ziv Bar-Yossef, Sridhar Rajagopalan, WWW, 2002, pp. 580-591.

• Sampling algorithms: lower bounds and applications, Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar, STOC, 2001, pp. 266-275.

• Approximating Aggregate Queries about Web Pages via Random Walks, Ziv Bar-Yossef, Alexander Berg, Steve Chien, Jittat Fakcharoenphol, Dror Weitz, VLDB, 2000, pp. 535-544.

• Deterministic Amplification of Space-Bounded Probabilistic Algorithms, Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson, IEEE Conference on Computational Complexity, 1999, pp. 188-.

• Querying Semantically Tagged Documents on the World-Wide Web, Ziv Bar-Yossef, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv, NGITS, 1999, pp. 2-19.

• Pointer Jumping Requires Concurrent Read, Noam Nisan, Ziv Bar-Yossef, STOC, 1997, pp. 549-558.