1: Simple and Near-Optimal Distributed Coloring for Sparse Graphs
2: Approximate nearest neighbors search without false negatives for $l_2$ for $c>\sqrt{\log\log{n}}$
3: Game Efficiency through Linear Programming Duality
4: Recovering Nonuniform Planted Partitions via Iterated Projection
5: Back to the Future: an Even More Nearly Optimal Cardinality Estimation Algorithm
6: Static Graph Challenge: Subgraph Isomorphism
7: More declarative tabling in Prolog using multi-prompt delimited control
8: Elements of nonlinear analysis of information streams
9: GALILEO: A Generalized Low-Entropy Mixture Model
10: Exploiting Computation-Friendly Graph Compression Methods
11: A Fast Approximation Scheme for Low-Dimensional $k$-Means
12: One-Way Trail Orientations
13: Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
14: Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search
15: Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern
16: Algorithms for Big Data: Graphs and PageRank
17: Efficient Adaptive Implementation of the Serial Schedule Generation Scheme using Preprocessing and Bloom Filters
18: Stability of the Lanczos Method for Matrix Function Approximation
19: $\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent
20: Streaming Graph Challenge: Stochastic Block Partition
21: Network Essence: PageRank Completion and Centrality-Conforming Markov Chains
22: An Algorithm of Parking Planning for Smart Parking System
23: A Model for Donation Verification
24: Strassen’s 2x2 matrix multiplication algorithm: A conceptual perspective