Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Traditional security protocols are mainly concerned with key establishment and principal authentication and rely on predistributed keys and properties of cryptographic operators. I...
David A. Basin, Srdjan Capkun, Patrick Schaller, B...
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...