753 search results - page 28 / 151 » Completing a (k - 1)-Assignment |
OPODIS
2008
14 years 11 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
MST
2006
14 years 9 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
IUI
2010
ACM
15 years 6 months ago
2010
ACM
We have developed a simulator to help with the design and evaluation of assistive interfaces. The simulator can predict possible interaction patterns when undertaking a task using...
198
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...