367 search results - page 68 / 74 » Tight lower bounds for the online labeling problem |
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
SPAA
2004
ACM
14 years 27 days ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
SENSYS
2004
ACM
14 years 27 days ago
2004
ACM
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over...