FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...