| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Ziv Bar-Yossef Ziv Bar-Yossef, Marcus Fontoura , Vanja Josifovski : Buffering in Query Evaluation over XML Streams. PODS 2005 Ziv Bar-Yossef, T. S. Jayram , Robert Krauthgamer , Ravi Kumar : The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004 : 261-272 Ziv Bar-Yossef, T. S. Jayram , Robert Krauthgamer , Ravi Kumar : Approximating Edit Distance Efficiently. FOCS 2004 : 550-559 Ziv Bar-Yossef, Marcus Fontoura , Vanja Josifovski : On the Memory Requirements of XPath Evaluation over XML Streams. PODS 2004 : 177-188 Ziv Bar-Yossef, T. S. Jayram , Iordanis Kerenidis : Exponential separation of quantum and classical one-way communication complexity. STOC 2004 : 128-137 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 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) Ziv Bar-Yossef: Sampling lower bounds via information theory. STOC 2003 : 335-344 Ziv Bar-Yossef: Sampling Lower Bounds via Information Theory Electronic Colloquium on Computational Complexity (ECCC) 10 (037): (2003) Ziv Bar-Yossef, T. S. Jayram , Ravi Kumar , D. Sivakumar : An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002 : 209-218 Ziv Bar-Yossef, Luca Trevisan , Omer Reingold , Ronen Shaltiel : Streaming Computation of Combinatorial Objects. IEEE Conference on Computational Complexity 2002 : 165-174 Ziv Bar-Yossef, T. S. Jayram , Ravi Kumar , D. Sivakumar : Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002 : 93-102 Ziv Bar-Yossef, T. S. Jayram , Ravi Kumar , D. Sivakumar , Luca Trevisan : Counting Distinct Elements in a Data Stream. RANDOM 2002 : 1-10 Ziv Bar-Yossef, Ravi Kumar , D. Sivakumar : Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002 : 623-632 Ziv Bar-Yossef, Kirsten Hildrum , Felix Wu : Incentive-compatible online auctions for digital goods. SODA 2002 : 964-970 Ziv Bar-Yossef, Sridhar Rajagopalan : Template detection via data mining and its applications. WWW 2002 : 580-591 Ziv Bar-Yossef, Ravi Kumar , D. Sivakumar : Sampling algorithms: lower bounds and applications. STOC 2001 : 266-275 Ziv Bar-Yossef, Alexander Berg , Steve Chien , Jittat Fakcharoenphol , Dror Weitz : Approximating Aggregate Queries about Web Pages via Random Walks. VLDB 2000 : 535-544 Ziv Bar-Yossef, Oded Goldreich , Avi Wigderson : Deterministic Amplification of Space-Bounded Probabilistic Algorithms. IEEE Conference on Computational Complexity 1999 : 188- 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 Ziv Bar-Yossef, Oded Goldreich , Avi Wigderson : Deterministic Amplification of Space Bounded Probabilistic Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 5 (72): (1998) Noam Nisan , Ziv Bar-Yossef: Pointer Jumping Requires Concurrent Read. STOC 1997 : 549-558 Noam Nisan , Ziv Bar-Yossef: Pointer Jumping Requires Concurrent Read Electronic Colloquium on Computational Complexity (ECCC) 4 (8): (1997) 1 [ 6 ] 2 [ 18 ] 3 [ 6 ] 4 [ 6 ] 5 [ 20 ] [ 23 ] 6 [ 3 ] [ 5 ] 7 [ 9 ] 8 [ 11 ] [ 12 ] [ 14 ] [ 17 ] [ 19 ] [ 21 ] [ 22 ] 9 [ 20 ] [ 23 ] 10 [ 4 ] 11 [ 17 ] [ 19 ] 12 [ 4 ] 13 [ 21 ] [ 22 ] 14 [ 7 ] [ 10 ] [ 11 ] [ 12 ] [ 14 ] [ 18 ] [ 21 ] [ 22 ] 15 [ 1 ] [ 2 ] 16 [ 4 ] 17 [ 8 ] 18 [ 13 ] 19 [ 4 ] 20 [ 13 ] 21 [ 7 ] [ 10 ] [ 11 ] [ 12 ] [ 14 ] 22 [ 18 ] 23 [ 11 ] [ 13 ] 24 [ 6 ] 25 [ 3 ] [ 5 ] 26 [ 9 ]  ©2005 Association for Computing Machinery |
