1: Computing rational points in convex semi-algebraic sets and SOS decompositions
2: Wee LCP
3: Parameterized Complexity of the k-anonymity Problem
4: Testing Distribution Identity Efficiently
5: The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time
6: Faster Algorithms for Max-Product Message-Passing
7: b-Bit Minwise Hashing
8: Searching a bitstream in linear time for the longest substring of any given density