6. RANDOM 2002:
Cambridge, MA, USA
: Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes.
: Finding Sparse Induced Subgraphs of Semirandom Graphs.
: A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms.
: Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications.
: Classifying Special Interest Groups in Web Graphs.