- An information statistics approach to data stream and communication complexity
- Approximating Aggregate Queries about Web Pages via Random Walks
- Local Approximation of PageRank and Reverse PageRank Ziv Bar-Yossef
- The Space Complexity of Processing XML Twig Queries Over Indexed Documents
- An information statistics approach to data stream and communication complexity
- Deterministic Amplification of Space Bounded Randomized A thesis submitted in fulfillment
- Exponential Separation of Quantum and Classical OneWay Communication Complexity
- Sampling Lower Bounds via Information Theory # Ziv BarYossef +
- Do not Crawl in the DUST: Different URLs with Similar Text Extended Abstract
- Information Theory Methods in Communication Complexity Ziv Bar-Yossef
- On the Memory Requirements of XPath Evaluation over XML Streams
- Streaming Computation of Combinatorial Objects # Ziv BarYossef +
- Template Detection via Data Mining and its Applications Ziv BarYossef #
- Deterministic Amplification of SpaceBounded Probabilistic Algorithms Ziv BarYossef
- Efficient Search Engine Measurements Ziv Bar-Yossef
- Querying Semantically Tagged Documents on the WorldWide Web ?
- The Sketching Complexity of Pattern Matching Ziv BarYossef, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar
- Mining Search Engine Query Logs via Suggestion Ziv Bar-Yossef
- Sampling Algorithms: Lower Bounds and Applications Ziv Bar-Yossef y
- Sampling Algorithms: Lower Bounds and Applications [Extended Abstract] #
- Local Approximation of PageRank and Reverse PageRank Ziv Bar-Yossef
- The Space Complexity of Processing XML Twig Queries Over Indexed Documents ,
- Index Coding with Side Information Ziv Bar-Yossef
- Sampling Lower Bounds via Information Theory [Extended Abstract] #
- Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs
- Buffering in Query Evaluation over XML Streams Ziv Bar-Yossef
- RaWMS -Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks
- Sic Transit Gloria Telae : Towards an Understanding of the
- Cluster Ranking with an Application to Mining Mailbox Networks Ziv Bar-Yossef
- Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs
- Random Sampling from a Search Engine's Index Ziv Bar-Yossef
- Local Approximation of PageRank and Reverse PageRank Ziv Bar-Yossef
- Context-Sensitive Query Auto-Completion Ziv Bar-Yossef
- Approximating Edit Distance Efficiently Ziv BarYossef # T. S. Jayram + Robert Krauthgamer + Ravi Kumar +
- Streaming Computation of Combinatorial Objects Ziv Bar-Yossef Omer Reingold y Ronen Shaltiel z Luca Trevisan x
- Counting distinct elements in a data stream Ziv BarYossef 1 , T. S. Jayram 2 , Ravi Kumar 2 , D. Sivakumar 2 , and Luca
- Do Not Crawl in the DUST: Different URLs with Similar Text ZIV BAR-YOSSEF and IDIT KEIDAR
- On the Memory Requirements of XPath Evaluation over XML Streams
- Pointer Jumping Requires Concurrent Read Department of Computer Science
- Information Theory Methods in Communication Complexity Ziv BarYossef #
- The Complexity of Massive Data Set Computations Ziv BarYossef
- IncentiveCompatible Online Auctions for Digital Goods Ziv BarYossef Kirsten Hildrum Felix Wu #
- Index Coding with Side Information Ziv Bar-Yossef Yitzhak Birk T. S. Jayram Tomer Kol
- Estimating the ImpressionRank of Web Pages Ziv Bar-Yossef
- Efficient Search Engine Measurements Ziv Bar-Yossef
- Do Not Crawl in the DUST: Different URLs with Similar Text
- Knowl Inf Syst DOI 10.1007/s10115-007-0096-0
- Random Sampling from a Search Engine's Index Ziv Bar-Yossef
- RaWMS -Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks
- EXPONENTIAL SEPARATION OF QUANTUM AND CLASSICAL ONE-WAY COMMUNICATION COMPLEXITY
