1: Regular and almost universal hashing: an efficient implementation
2: Technical Report: Graph-Structured Sparse Optimization for Connected Subgraph Detection
3: PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions
4: Fast and Compact Planar Embeddings
5: Real Stability Testing
6: Polynomial Time Algorithms for Bichromatic Problems
7: $O(m^9)$ network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
8: On the Weighted Quartet Consensus problem
9: Facility Leasing with Penalties
10: Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness
11: Reducing Opacity to Linearizability: A Sound and Complete Method
12: A recursive algorithm for a pipeline maintenance scheduling problem
13: Approximation Algorithms for Stochastic k-TSP
14: A Non-generative Framework and Convex Relaxations for Unsupervised Learning
15: On the Algorithmic Significance and Analysis of the Method of DaYan Deriving One
16: A framework for small but rich vehicle routing problems
17: A general lower bound for collaborative tree exploration
18: Efficient Best-Response Computation for Strategic Network Formation under Attack
19: On Equivalent Color Transform and Four Coloring Theorem
20: Efficient L1-Norm Principal-Component Analysis via Bit Flipping
21: Polynomial-time Tensor Decompositions with Sum-of-Squares
22: Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities
23: A Hybrid Sampling Scheme for Triangle Counting
24: An efficient high-probability algorithm for Linear Bandits
25: QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding