1: Using a Non-Commutative Bernstein Bound to Approximate Some Matrix Algorithms in the Spectral Norm
2: Orthogonal Range Searching on the RAM, Revisited
3: Acyclic and Star Colorings of Cographs
4: Polynomial kernels for Proper Interval Completion and related problems
5: Recoverable Values for Independent Sets
6: Buffer Overflow Management with Class Segregation
7: Colorful Triangle Counting and a MapReduce Implementation
8: The Grothendieck constant is strictly smaller than Krivine’s bound