The Log-Approximate-Rank Conjecture Is False.
Planar Graph Perfect Matching Is in NC.
Forcing and Calculi for Hybrid Logics.
Scene Grammars, Factor Graphs, and Belief Propagation.
Embeddability in R
A Simple and Approximately Optimal Mechanism for an Additive Buyer.
Planar Graphs Have Bounded Queue-Number.