| 2011 | ||
|---|---|---|
| j10 | Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol: Index Coding With Side Information. IEEE Transactions on Information Theory 57(3): 1479-1494 (2011) | |
| j9 | ||
| c31 | ||
| 2009 | ||
| j8 | Ziv Bar-Yossef, Idit Keidar, Uri Schonfeld: Do not crawl in the DUST: Different URLs with similar text. TWEB 3(1): 3 (2009) | |
| c30 | ||
| 2008 | ||
| j7 | ||
| j6 | Ziv Bar-Yossef, Ido Guy, Ronny Lempel, Yoëlle S. Maarek, Vladimir Soroka: Cluster ranking with an application to mining mailbox networks. Knowl. Inf. Syst. 14(1): 101-139 (2008) | |
| j5 | Ziv Bar-Yossef, Maxim Gurevich: Mining search engine query logs via suggestion sampling. PVLDB 1(1): 54-65 (2008) | |
| j4 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis: Exponential Separation of Quantum and Classical One-Way Communication Complexity. SIAM J. Comput. 38(1): 366-384 (2008) | |
| j3 | Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot: RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks. ACM Trans. Comput. Syst. 26(2) (2008) | |
| c29 | Ziv Bar-Yossef, Li-Tal Mashiach: Local approximation of pagerank and reverse pagerank. CIKM 2008: 279-288 | |
| c28 | Mirit Shalem, Ziv Bar-Yossef: The Space Complexity of Processing XML Twig Queries Over Indexed Documents. ICDE 2008: 824-832 | |
| c27 | Ziv Bar-Yossef, Li-Tal Mashiach: Local approximation of PageRank and reverse PageRank. SIGIR 2008: 865-866 | |
| 2007 | ||
| j2 | Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski: On the memory requirements of XPath evaluation over XML streams. J. Comput. Syst. Sci. 73(3): 391-441 (2007) | |
| c26 | Ziv Bar-Yossef, Idit Keidar, Uri Schonfeld: Do not crawl in the dust: different urls with similar text. WWW 2007: 111-120 | |
| c25 | ||
| 2006 | ||
| c24 | Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol: Index Coding with Side Information. FOCS 2006: 197-206 | |
| c23 | Ziv Bar-Yossef, Ido Guy, Ronny Lempel, Yoëlle S. Maarek, Vladimir Soroka: Cluster Ranking with an Application to Mining Mailbox Networks. ICDM 2006: 63-74 | |
| c22 | Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot: RaWMS -: random walk based lightweight membership service for wireless ad hoc network. MobiHoc 2006: 238-249 | |
| c21 | ||
| c20 | Uri Schonfeld, Ziv Bar-Yossef, Idit Keidar: Do not crawl in the DUST: different URLs with similar text. WWW 2006: 1015-1016 | |
| 2005 | ||
| c19 | Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski: Buffering in query evaluation over XML streams. PODS 2005: 216-227 | |
| 2004 | ||
| j1 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4): 702-732 (2004) | |
| c18 | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004: 261-272 | |
| c17 | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Approximating Edit Distance Efficiently. FOCS 2004: 550-559 | |
| c16 | Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski: On the Memory Requirements of XPath Evaluation over XML Streams. PODS 2004: 177-188 | |
| c15 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis: Exponential separation of quantum and classical one-way communication complexity. STOC 2004: 128-137 | |
| c14 | Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andrew Tomkins: Sic transit gloria telae: towards an understanding of the web's decay. WWW 2004: 328-337 | |
| i4 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis: Exponential Separation of Quantum and Classical One-Way Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC)(036) (2004) | |
| 2003 | ||
| c13 | ||
| i3 | Ziv Bar-Yossef: Sampling Lower Bounds via Information Theory. Electronic Colloquium on Computational Complexity (ECCC) 10(037) (2003) | |
| 2002 | ||
| c12 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002: 93-102 | |
| c11 | Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel: Streaming Computation of Combinatorial Objects. IEEE Conference on Computational Complexity 2002: 165-174 | |
| c10 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218 | |
| c9 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan: Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10 | |
| c8 | Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar: Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002: 623-632 | |
| c7 | Ziv Bar-Yossef, Kirsten Hildrum, Felix Wu: Incentive-compatible online auctions for digital goods. SODA 2002: 964-970 | |
| c6 | Ziv Bar-Yossef, Sridhar Rajagopalan: Template detection via data mining and its applications. WWW 2002: 580-591 | |
| 2001 | ||
| c5 | Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar: Sampling algorithms: lower bounds and applications. STOC 2001: 266-275 | |
| 2000 | ||
| c4 | Ziv Bar-Yossef, Alexander C. Berg, Steve Chien, Jittat Fakcharoenphol, Dror Weitz: Approximating Aggregate Queries about Web Pages via Random Walks. VLDB 2000: 535-544 | |
| 1999 | ||
| c3 | Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson: Deterministic Amplification of Space-Bounded Probabilistic Algorithms. IEEE Conference on Computational Complexity 1999: 188- | |
| c2 | Ziv Bar-Yossef, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv: Querying Semantically Tagged Documents on the World-Wide Web. NGITS 1999: 2-19 | |
| 1998 | ||
| i2 | Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson: Deterministic Amplification of Space Bounded Probabilistic Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 5(72) (1998) | |
| 1997 | ||
| c1 | ||
| i1 | Noam Nisan, Ziv Bar-Yossef: Pointer Jumping Requires Concurrent Read. Electronic Colloquium on Computational Complexity (ECCC) 4(8) (1997) | |
Colors in the list of coauthors
Last update Sat May 25 06:15:01 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page