default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZiv Bar-Yossef
- > Home > Persons > Ziv Bar-Yossef
Publications
- 2011
[j10]Ziv Bar-Yossef, Yitzhak Birk
, T. S. Jayram, Tomer Kol:
Index Coding With Side Information. IEEE Trans. Inf. Theory 57(3): 1479-1494 (2011)- [j9]Ziv Bar-Yossef, Maxim Gurevich:
Efficient Search Engine Measurements. ACM Trans. Web 5(4): 18:1-18:48 (2011) - [c31]Ziv Bar-Yossef, Naama Kraus:
Context-sensitive query auto-completion. WWW 2011: 107-116 - 2009
- [j8]Ziv Bar-Yossef, Idit Keidar, Uri Schonfeld:
Do not crawl in the DUST: Different URLs with similar text. ACM Trans. Web 3(1): 3:1-3:31 (2009) - [c30]Ziv Bar-Yossef, Maxim Gurevich:
Estimating the impressionrank of web pages. WWW 2009: 41-50 - 2008
- [j7]Ziv Bar-Yossef, Maxim Gurevich:
Random sampling from a search engine's index. J. ACM 55(5): 24:1-24:74 (2008) - [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. Proc. VLDB Endow. 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): 5:1-5:66 (2008) - [c28]Mirit Shalem, Ziv Bar-Yossef:
The Space Complexity of Processing XML Twig Queries Over Indexed Documents. ICDE 2008: 824-832 - 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]Ziv Bar-Yossef, Maxim Gurevich:
Efficient search engine measurements. WWW 2007: 401-410 - 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]Ziv Bar-Yossef, Maxim Gurevich:
Random sampling from a search engine's index. WWW 2006: 367-376 - [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. Electron. Colloquium Comput. Complex. TR04 (2004) - 2002
- [c12]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
Information Theory Methods in Communication Complexity. CCC 2002: 93-102 - [c11]Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel:
Streaming Computation of Combinatorial Objects. CCC 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. CCC 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. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c1]Noam Nisan, Ziv Bar-Yossef:
Pointer Jumping Requires Concurrent Read. STOC 1997: 549-558 - [i1]Noam Nisan, Ziv Bar-Yossef:
Pointer Jumping Requires Concurrent Read. Electron. Colloquium Comput. Complex. TR97 (1997)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
