2009 | ||
---|---|---|
42 | Ziv Bar-Yossef, Maxim Gurevich: Estimating the impressionrank of web pages. WWW 2009: 41-50 | |
41 | Ziv Bar-Yossef, Idit Keidar, Uri Schonfeld: Do not crawl in the DUST: Different URLs with similar text. TWEB 3(1): 3 (2009) | |
2008 | ||
40 | Ziv Bar-Yossef, Li-Tal Mashiach: Local approximation of pagerank and reverse pagerank. CIKM 2008: 279-288 | |
39 | Mirit Shalem, Ziv Bar-Yossef: The Space Complexity of Processing XML Twig Queries Over Indexed Documents. ICDE 2008: 824-832 | |
38 | Ziv Bar-Yossef, Li-Tal Mashiach: Local approximation of PageRank and reverse PageRank. SIGIR 2008: 865-866 | |
37 | 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) | |
36 | Ziv Bar-Yossef, Maxim Gurevich: Random sampling from a search engine's index. J. ACM 55(5): (2008) | |
35 | 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) | |
34 | Ziv Bar-Yossef, Maxim Gurevich: Mining search engine query logs via suggestion sampling. PVLDB 1(1): 54-65 (2008) | |
33 | 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) | |
2007 | ||
32 | Ziv Bar-Yossef, Idit Keidar, Uri Schonfeld: Do not crawl in the dust: different urls with similar text. WWW 2007: 111-120 | |
31 | Ziv Bar-Yossef, Maxim Gurevich: Efficient search engine measurements. WWW 2007: 401-410 | |
30 | 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) | |
2006 | ||
29 | Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol: Index Coding with Side Information. FOCS 2006: 197-206 | |
28 | 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 | |
27 | Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot: RaWMS -: random walk based lightweight membership service for wireless ad hoc network. MobiHoc 2006: 238-249 | |
26 | Uri Schonfeld, Ziv Bar-Yossef, Idit Keidar: Do not crawl in the DUST: different URLs with similar text. WWW 2006: 1015-1016 | |
25 | Ziv Bar-Yossef, Maxim Gurevich: Random sampling from a search engine's index. WWW 2006: 367-376 | |
2005 | ||
24 | Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski: Buffering in query evaluation over XML streams. PODS 2005: 216-227 | |
2004 | ||
23 | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004: 261-272 | |
22 | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Approximating Edit Distance Efficiently. FOCS 2004: 550-559 | |
21 | Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski: On the Memory Requirements of XPath Evaluation over XML Streams. PODS 2004: 177-188 | |
20 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis: Exponential separation of quantum and classical one-way communication complexity. STOC 2004: 128-137 | |
19 | 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 | |
18 | 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) | |
17 | 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) | |
2003 | ||
16 | Ziv Bar-Yossef: Sampling lower bounds via information theory. STOC 2003: 335-344 | |
15 | Ziv Bar-Yossef: Sampling Lower Bounds via Information Theory Electronic Colloquium on Computational Complexity (ECCC) 10(037): (2003) | |
2002 | ||
14 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218 | |
13 | Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel: Streaming Computation of Combinatorial Objects. IEEE Conference on Computational Complexity 2002: 165-174 | |
12 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002: 93-102 | |
11 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan: Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10 | |
10 | Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar: Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002: 623-632 | |
9 | Ziv Bar-Yossef, Kirsten Hildrum, Felix Wu: Incentive-compatible online auctions for digital goods. SODA 2002: 964-970 | |
8 | Ziv Bar-Yossef, Sridhar Rajagopalan: Template detection via data mining and its applications. WWW 2002: 580-591 | |
2001 | ||
7 | Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar: Sampling algorithms: lower bounds and applications. STOC 2001: 266-275 | |
2000 | ||
6 | 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 | ||
5 | Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson: Deterministic Amplification of Space-Bounded Probabilistic Algorithms. IEEE Conference on Computational Complexity 1999: 188- | |
4 | 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 | ||
3 | Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson: Deterministic Amplification of Space Bounded Probabilistic Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 5(72): (1998) | |
1997 | ||
2 | Noam Nisan, Ziv Bar-Yossef: Pointer Jumping Requires Concurrent Read. STOC 1997: 549-558 | |
1 | Noam Nisan, Ziv Bar-Yossef: Pointer Jumping Requires Concurrent Read Electronic Colloquium on Computational Complexity (ECCC) 4(8): (1997) |