156 search results - page 8 / 32 » On the Round Complexity of Covert Computation |
DAM
2006
13 years 8 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
COMCOM
2004
13 years 8 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
CRYPTO
2001
Springer
14 years 28 days ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...