1: Near-Optimal Bayesian Active Learning with Noisy Observations
2: Wireless Scheduling with Power Control
3: The rigidity transition in random graphs
4: Fixed-parameter tractability of multicut parameterized by the size of the cutset
5: The set of realizations of a max-plus linear sequence is semi-polyhedral
6: Unifying the Landscape of Cell-Probe Lower Bounds
7: Random Projection Trees Revisited
8: On Graph Crossing Number and Edge Planarization
9: An iterative approach for amplitude amplification with nonorthogonal measurements
10: Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition
11: Energy-Efficient Multiprocessor Scheduling for Flow Time and Makespan
12: Wireless Capacity with Oblivious Power in General Metrics
13: Rational Convex Programs, Their Feasibility, and the Arrow-Debreu Nash Bargaining Game
14: Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations