4419 search results - page 670 / 884 » Information Science in Transition |
196
click to vote
PKC
2009
Springer
16 years 7 months ago
2009
Springer
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
311
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
315
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
170
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
190
click to vote
CSCW
2010
ACM
16 years 3 months ago
2010
ACM
People are often required to catch up on information they have missed in meetings, because of lateness or scheduling conflicts. Catching up is a complex cognitive process where pe...