Compact oracles for reachability and approximate distances in planar digraphs.
Fast monte-carlo algorithms for finding low-rank approximations.
New lattice-based cryptographic constructions.
Concurrent zero-knowledge.
A new approach to dynamic all pairs shortest paths.
Spatial gossip and resource location protocols.