The Sketching Complexity of Pattern Matching. Bar-Yossef, Z., Jayram, T. S., Krauthgamer, R., & Kumar, R. In Jansen, K., Khanna, S., Rolim, J. D. P., & Ron, D., editors, APPROX-RANDOM, volume 3122, of Lecture Notes in Computer Science, pages 261-272, 2004. Springer.
The Sketching Complexity of Pattern Matching. [link]Link  The Sketching Complexity of Pattern Matching. [link]Paper  bibtex   
@inproceedings{conf/approx/Bar-YossefJKK04,
  added-at = {2017-05-23T00:00:00.000+0200},
  author = {Bar-Yossef, Ziv and Jayram, T. S. and Krauthgamer, Robert and Kumar, Ravi},
  biburl = {https://www.bibsonomy.org/bibtex/29d66c855c8331bb121c9431fe985477c/dblp},
  booktitle = {APPROX-RANDOM},
  crossref = {conf/approx/2004},
  editor = {Jansen, Klaus and Khanna, Sanjeev and Rolim, José D. P. and Ron, Dana},
  ee = {https://doi.org/10.1007/978-3-540-27821-4_24},
  interhash = {793fbb6415d5ac8acffdcacc9e403f69},
  intrahash = {9d66c855c8331bb121c9431fe985477c},
  isbn = {3-540-22894-2},
  keywords = {dblp},
  pages = {261-272},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T20:03:34.000+0200},
  title = {The Sketching Complexity of Pattern Matching.},
  url = {http://dblp.uni-trier.de/db/conf/approx/approx2004.html#Bar-YossefJKK04},
  volume = 3122,
  year = 2004
}

Downloads: 0