Generalized hypertree decompositions: NP-hardness and tractable variants.
On lattices, learning with errors, random linear codes, and cryptography.
Introduction to PODS 2007 special section.
The complexity of query containment in expressive fragments of XPath 2.0.
Triangulation and embedding using small sets of beacons.
A property of quantum relative entropy with an application to privacy in quantum communication.