Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
Successful software systems continuously change their requirements and thus code. When this happens, some existing tests get broken because they no longer reflect the intended be...
Brett Daniel, Danny Dig, Tihomir Gvero, Vilas Jaga...
We introduce Re-FUSE, a framework that provides support for restartable user-level file systems. Re-FUSE monitors the user-level file-system and on a crash transparently restart...
Typically, users interact with database systems by formulating queries. However, many times users do not have a clear understanding of their information needs or the exact content...