Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
Limits on the Hardness of Lattice Problems in ? p Norms
A Decade of Lattice Cryptography
Completely fair SFE and coalition-safe cheap talk
Foundations and Trends® in Theoretical Computer Science
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
computational complexity
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC ’04
Santosh Vempala
Daniel Dadush
Silvio Micali
Matt Lepinski
Beyond nash equilibrium
(Gap/S)ETH hardness of SVP