16616 search results - page 2971 / 3324 » Extending Extended Vacuity |
171
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
180
click to vote
COCOA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
196
click to vote
CRYPTO
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
181
click to vote
DRM
2007
Springer
16 years 1 months ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
164
Voted
ESA
2007
Springer
16 years 1 months ago
2007
Springer
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...