Upper Bound on Communication Complexity of Private Information Retrieval

Andris Ambainis. Upper Bound on Communication Complexity of Private Information Retrieval. In Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, ICALP 97, Bologna, Italy, 7-11 July 1997, Proceedings. Volume 1256 of Lecture Notes in Computer Science, pages 401-407, Springer, 1997.

@inproceedings{Ambainis97,
  title = {Upper Bound on Communication Complexity of Private Information Retrieval},
  author = {Andris Ambainis},
  year = {1997},
  tags = {information retrieval},
  researchr = {https://researchr.org/publication/Ambainis97},
  cites = {0},
  citedby = {0},
  pages = {401-407},
  booktitle = {Automata, Languages and Programming, 24th International Colloquium, ICALP 97, Bologna, Italy, 7-11 July 1997, Proceedings},
  editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela},
  volume = {1256},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-63165-8},
}