1: Near-Optimal Algorithms for Online Matrix Prediction
2: Improved Approximation for Orienting Mixed Graphs
3: Sequential & Parallel Algorithms for Big-Integer Numbers Subtraction
4: Sequential and Parallel Algorithms for the Addition of Big-Integer Numbers
5: A Note on the Balanced ST-Connectivity
6: Self-improving Algorithms for Coordinate-wise Maxima
7: Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
8: A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
9: Testing Booleanity and the Uncertainty Principle
10: Approximability of the Vertex Cover Problem in Power Law Graphs
11: Fast Multi-Scale Detection of Relevant Communities
12: Online submodular welfare maximization: Greedy is optimal
13: Set It and Forget It: Approximating the Set Once Strip Cover Problem
14: Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
15: Faster Algorithms for Rectangular Matrix Multiplication
16: Faster Walks in Graphs: A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity
17: On the Value of Multiple Read/Write Streams for Data Compression
18: An approximation algorithm for the link building problem
19: Spectra: Robust Estimation of Distribution Functions in Networks
20: A single-exponential FPT algorithm for the $K_4$-minor cover problem
21: Learning Fuzzy {\beta}-Certain and {\beta}-Possible rules from incomplete quantitative data by rough sets
22: Algorithmic Applications of Baur-Strassen’s Theorem: Shortest Cycles, Diameter and Matchings