1: Computing Resolution-Path Dependencies in Linear Time
2: Communication-Optimal Parallel Algorithm for Strassen’s Matrix Multiplication
3: Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
4: Greedy Sequential Maximal Independent Set and Matching are Parallel on Average
5: Linear-Space Substring Range Counting over Polylogarithmic Alphabets
6: Quick Detection of Nodes with Large Degrees
7: Speeding-up $q$-gram mining on grammar-based compressed texts
8: Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation
9: Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows
10: Pattern Matching in Multiple Streams
11: Near-optimal Coresets For Least-Squares Regression
12: Finding a most biased coin with fewest flips
13: An efficient polynomial time approximation scheme for load balancing on uniformly related machines
14: Cross-Document Pattern Matching
15: Generalized selfish bin packing
16: On the Implications of Lookahead Search in Game Playing
17: Interval Routing Schemes for Circular-Arc Graphs
18: Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games
19: Space-Constrained Interval Selection
20: Strong Backdoors to Nested Satisfiability
21: Induced Disjoint Paths in Claw-Free Graphs
22: The best of both worlds: stochastic and adversarial bandits
23: A Constant Factor Approximation Algorithm for Reordering Buffer Management
24: Making Evildoers Pay: Resource-Competitive Broadcast in Sensor Networks
25: Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs