Cell-probe lower bounds for the partial match problem

T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani. Cell-probe lower bounds for the partial match problem. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 667-672, ACM, 2003. [doi]

@inproceedings{JayramKKR03,
  title = {Cell-probe lower bounds for the partial match problem},
  author = {T. S. Jayram and Subhash Khot and Ravi Kumar and Yuval Rabani},
  year = {2003},
  doi = {10.1145/780542.780639},
  url = {http://doi.acm.org/10.1145/780542.780639},
  researchr = {https://researchr.org/publication/JayramKKR03},
  cites = {0},
  citedby = {0},
  pages = {667-672},
  booktitle = {Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA},
  publisher = {ACM},
  isbn = {1-58113-674-9},
}