1: What can be sampled locally?
2: Communication-Optimal Distributed Clustering
3: The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
4: Convergence Results for Neural Networks via Electrodynamics
5: Distributed Approximation Algorithms for the Multiple Knapsack Problem
6: Natasha: Faster Non-Convex Stochastic Optimization Via Strongly Non-Convex Parameter
7: DCT-like Transform for Image Compression Requires 14 Additions Only
8: Ranking vertices for active module recovery problem
9: An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension
10: Improved Guarantees for Vertex Sparsification in Planar Graphs
11: Fast and Simple Jumbled Indexing for Binary RLE Strings
12: New cardinality estimation algorithms for HyperLogLog sketches
13: An Adaptive Sublinear-Time Block Sparse Fourier Transform
14: Combinatorial Secretary Problems with Ordinal Information
15: From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back
16: Efficient Algorithms for k-Regret Minimizing Sets
17: Real-Time Influence Maximization on Dynamic Social Streams
18: On the Value of Penalties in Time-Inconsistent Planning
19: Distributed Evolutionary k-way Node Separators
20: Variant tolerant read mapping using min-hashing
21: A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
22: A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications
23: A local search 2.917-approximation algorithm for duo-preservation string mapping