31 search results - page 5 / 7 » icalp 2001 |
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...