We present a quantum augmented variant of the dual lattice attack on the...
A fundamental computational problem is to find a shortest non-zero vecto...
We consider online algorithms for the k-server problem on trees. Chrobak...
We study the quantum query complexity of two problems.
First, we consi...
The most important computational problem on lattices is the Shortest Vec...
We present new classical and quantum algorithms for solving random subse...
We consider the problem of determining if a sequence of parentheses is w...