A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
Iftach HaitnerJonathan J. HochGil SegevPublished in: TCC (2008)
Keyphrases
- single server
- lower bound
- retrial queue
- worst case
- upper bound
- priority scheduling
- special case
- queueing networks
- private information retrieval
- branch and bound algorithm
- parallel machines
- state dependent
- objective function
- queue length
- heavy traffic
- service times
- markov chain
- lightweight
- neural network
- np hard
- digital libraries
- computational complexity
- queuing model
- database systems