Private approximation of search problems

Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006 — 2006

DOI Link

BibTeX

@inproceedings{DBLP:conf/stoc/BeimelCNW06,
  author = {Beimel, Amos and Carmi, Paz and Nissim, Kobbi and Weinreb, Enav},
  editor = {Kleinberg, Jon M.},
  title = {Private approximation of search problems},
  booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
                    Seattle, WA, USA, May 21-23, 2006},
  pages = {119--128},
  publisher = {{ACM}},
  year = {2006},
  url = {https://doi.org/10.1145/1132516.1132533},
  doi = {10.1145/1132516.1132533},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl = {https://dblp.org/rec/conf/stoc/BeimelCNW06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}