68 search results - page 8 / 14 » focs 2007 |
101
click to vote
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
FOCS
2007
IEEE
15 years 1 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
FOCS
2007
IEEE
15 years 4 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
15 years 4 months ago
2007
IEEE
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...