1: CYCLADES: Conflict-free Asynchronous Machine Learning
2: Fast approximate furthest neighbors with data-dependent hashing
3: Hardness of the Pricing Problem for Chains in Barter Exchanges
4: A Fast Order-Based Approach for Core Maintenance
5: Fast Deterministic Selection
6: Online Budgeted Truthful Matching
7: On Solving Floating Point SSSP Using an Integer Priority Queue
8: A note on reductions between compressed sensing guarantees
9: Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication
10: Approximating the Spectral Sums of Large-scale Matrices using Chebyshev Approximations
11: A Minimal Variance Estimator for the Cardinality of Big Data Set Intersection
12: Temporal flows in Temporal networks
13: A Graph Partitioning Algorithm for Leak Detection in Water Distribution Networks
14: Predicting with Distributions
15: Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems
16: Finding Multiple New Optimal Locations in a Road Network
17: Recoverable robust spanning tree problem under interval uncertainty representations
18: Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments
19: Efficient tensor completion for color image and video recovery: Low-rank tensor train
20: Adaptive Submodular Ranking and Routing
21: Position-Indexed Formulations for Kidney Exchange
22: A Quantum Abacus based encoding system
23: Analyzing Distributed Join-Idle-Queue: A Fluid Limit Approach
24: Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis
25: Re-enabling high-speed caching for LSM-trees
26: A Distributed Force-Directed Algorithm on Giraph: Design and Experiments