1: On preserving non-discrimination when combining expert advice
2: Near-Linear Time Insertion-Deletion Codes and (1+$\varepsilon$)-Approximating Edit Distance via Indexing
3: Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons
4: Sparse Logistic Regression Learns All Discrete Pairwise Graphical Models
5: R-BBG$_2$: Recursive Bipartition of Bi-connected Graphs
6: Simon’s problem for linear functions
7: Simple and Fast BlockQuicksort using Lomuto’s Partitioning Scheme
8: On the Convergence Rate of Training Recurrent Neural Networks
9: A study on load-balanced variants of the bin packing problem
10: Challenges, Designs, and Performances of a Distributed Algorithm for Minimum-Latency of Data-Aggregation in Multi-Channel WSNs
11: On New Approaches of Maximum Weighted Target Coverage and Sensor Connectivity: Hardness and Approximation
12: A Maximum Linear Arrangement Problem on Directed Graphs
13: Sesquickselect: One and a half pivots for cache-efficient selection
14: Distinct Sampling on Streaming Data with Near-Duplicates
15: Private Algorithms Can Always Be Extended
16: Submodular Maximization Under A Matroid Constraint: Asking more from an old friend, the Greedy Algorithm
17: Improved Bounds for Randomly Sampling Colorings via Linear Programming
18: Weighted vertex cover on graphs with maximum degree 3
19: Non-Empty Bins with Simple Tabulation Hashing
20: On Fast Leverage Score Sampling and Optimal Learning
21: Multilevel Planarity
22: Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions