Polyhedral Clinching Auctions and the AdWords Polytope.
New Strong Direct Product Results in Communication Complexity.
On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions.
Learning without Concentration.
A Framework for Space Complexity in Algebraic Proof Systems.
Schaefer's Theorem for Graphs.
Invited Article Foreword.
Guarded Negation.