Optimal Bi-Valued Auctions

Optimal Binary Search Trees with Near Minimal Height

Optimal cache-aware suffix selection

Optimal Cache-Oblivious Mesh Layouts

Optimal Column-Based Low-Rank Matrix Reconstruction

Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP

Optimal Constrained Resource Allocation Strategies under Low Risk Circumstances

Optimal Covering Tours with Turn Costs

Optimal Data Placement on Networks With Constant Number of Clients

Optimal Deadline Scheduling with Commitment

Optimal deterministic ring exploration with oblivious asynchronous robots

Optimal Embedding Into Star Metrics

Optimal Eviction Policies for Stochastic Address Traces

Optimal Exploration of Terrains with Obstacles

Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices

Optimal Geometric Partitions, Covers and K-Centers

Optimal Gossip-Based Aggregate Computation

Optimal Indexes for Sparse Bit Vectors

Optimal lower bounds for locality sensitive hashing (except when q is tiny)

Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP