1: A class of AM-QFT algorithms for power-of-two FFT
2: Evaluation of Labeling Strategies for Rotating Maps
3: Sublinear algorithms for local graph centrality estimation
4: SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors
5: Cost-oblivious storage reallocation
6: Approximating the Regular Graphic TSP in near linear time
7: Quantum annealing
8: Optimal Encodings for Range Majority Queries
9: A Simple Algorithm for Hamiltonicity
10: A Joint Optimization of Operational Cost and Performance Interference in Cloud Data Centers
11: Orthogonal Graph Drawing with Inflexible Edges
12: Distribution-Aware Sampling and Weighted Model Counting for SAT
13: A Link-based Approach to Entity Resolution in Social Networks
14: How to go Viral: Cheaply and Quickly
15: FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs
16: Optimization Problems with Diseconomies of Scale via Decoupling
17: Network-Oblivious Algorithms
18: On Simplex Pivoting Rules and Complexity Theory
19: Supremum-Norm Convergence for Step-Asynchronous Successive Overrelaxation on M-matrices
20: Adjacency labeling schemes and induced-universal graphs
21: Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs
22: Cache-Oblivious VAT-Algorithms
23: Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model