1: The Power of Localization for Efficiently Learning Linear Separators with Noise
2: Communication lower bounds and optimal algorithms for programs that reference arrays – Part 1
3: An Improved Parameterized Algorithm for the Independent Feedback Vertex Set Problem
4: An n-ary Constraint for the Stable Marriage Problem
5: Exact and Heuristic Methods for the Assembly Line Worker Assignment and Balancing Problem
6: Parameterized Complexity of k-Chinese Postman Problem
7: Estimating the longest increasing sequence in polylogarithmic time
8: On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project
9: Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
10: Data Structures in Classical and Quantum Computing
11: The complexity of resolving conflicts on MAC
12: Fast Semidifferential-based Submodular Function Optimization
13: Sign Stable Projections, Sign Cauchy Projections and Chi-Square Kernels
14: List H-Coloring a Graph by Removing Few Vertices
15: Online Algorithms for Basestation Allocation
16: Deterministic Integer Factorization Algorithms
17: An $O^(star)(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
18: Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations
19: On the Independent Set and Common Subgraph Problems in Random Graphs
20: All-Pairs Shortest Paths Algorithm for High-dimensional Sparse Graphs