Ziv Bar-Yossef

According to our database1, Ziv Bar-Yossef authored at least 31 papers between 1997 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Efficient Search Engine Measurements.
ACM Trans. Web, 2011

Index Coding With Side Information.
IEEE Trans. Inf. Theory, 2011

Context-sensitive query auto-completion.
Proceedings of the 20th International Conference on World Wide Web, 2011

2009
Do not crawl in the DUST: Different URLs with similar text.
ACM Trans. Web, 2009

Estimating the impressionrank of web pages.
Proceedings of the 18th International Conference on World Wide Web, 2009

2008
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks.
ACM Trans. Comput. Syst., 2008

Exponential Separation of Quantum and Classical One-Way Communication Complexity.
SIAM J. Comput., 2008

Mining search engine query logs via suggestion sampling.
Proc. VLDB Endow., 2008

Cluster ranking with an application to mining mailbox networks.
Knowl. Inf. Syst., 2008

Random sampling from a search engine's index.
J. ACM, 2008

The Space Complexity of Processing XML Twig Queries Over Indexed Documents.
Proceedings of the 24th International Conference on Data Engineering, 2008

Local approximation of pagerank and reverse pagerank.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007
On the memory requirements of XPath evaluation over XML streams.
J. Comput. Syst. Sci., 2007

2006
RaWMS -: random walk based lightweight membership service for wireless ad hoc network.
Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006

2005
Buffering in query evaluation over XML streams.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

2004
An information statistics approach to data stream and communication complexity.
J. Comput. Syst. Sci., 2004

Sic transit gloria telae: towards an understanding of the web's decay.
Proceedings of the 13th international conference on World Wide Web, 2004

Approximating Edit Distance Efficiently.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

The Sketching Complexity of Pattern Matching.
Proceedings of the Approximation, 2004

2003
Sampling Lower Bounds via Information Theory
Electron. Colloquium Comput. Complex., 2003

2002
Template detection via data mining and its applications.
Proceedings of the Eleventh International World Wide Web Conference, 2002

Reductions in streaming algorithms, with an application to counting triangles in graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Incentive-compatible online auctions for digital goods.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Counting Distinct Elements in a Data Stream.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

Streaming Computation of Combinatorial Objects.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

Information Theory Methods in Communication Complexity.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001
Sampling algorithms: lower bounds and applications.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000
Approximating Aggregate Queries about Web Pages via Random Walks.
Proceedings of the VLDB 2000, 2000

1999
Querying Semantically Tagged Documents on the World-Wide Web.
Proceedings of the Next Generation Information Technologies and Systems, 1999

1998
Deterministic Amplification of Space Bounded Probabilistic Algorithms.
Electron. Colloquium Comput. Complex., 1998

1997
Pointer Jumping Requires Concurrent Read
Electron. Colloquium Comput. Complex., 1997


  Loading...