1: On the Complexity of Real Root Isolation
2: $t$-Covering Arrays Generated by a Tiling Probability Model
3: CUR from a Sparse Optimization Viewpoint
4: Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning
5: Edge- and Node-Disjoint Paths in P Systems
6: A better tester for bipartiteness?
7: Parallelization of Weighted Sequence Comparison by using EBWT
8: A recombination algorithm for the decomposition of multivariate rational functions
9: Sorting by Transpositions is Difficult
10: Multiarmed Bandit Problems with Delayed Feedback
11: Santa Claus Schedules Jobs on Unrelated Machines
12: Hardness and Approximation of The Asynchronous Border Minimization Problem
13: Streaming Algorithms from Precision Sampling
14: Privately Releasing Conjunctions and the Statistical Query Barrier
15: Optimal Binary Search Trees with Near Minimal Height
16: Quantum query complexity of minor-closed graph properties
17: Improved analysis of the subsampled randomized Hadamard transform