We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist q...
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsou...
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...