1: Space Lower Bounds for Itemset Frequency Sketches
2: A New Approach to Efficient Enumeration by Push-out Amortization
3: Fast matrix completion without the condition number
4: Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries
5: The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
6: Constructing small tree grammars and small circuits for formulas
7: In Defense of MinHash Over SimHash
8: Conditioning and covariance on caterpillars
9: Online Packet-Routing in Grids with Bounded Buffers
10: A new algorithm for solving the rSUM problem
11: A simple and optimal ancestry labeling scheme for trees
12: Multiple Depot Ring Star Problem: A polyhedral study and exact algorithm
13: Design and Analysis of RS Sort
14: Abstractions, Algorithms and Data Structures for Structural Bioinformatics in PyCogent
15: How the Experts Algorithm Can Help Solve LPs Online
16: Complexity of Grundy coloring and its variants
17: Acyclic Edge Coloring through the Lov'asz Local Lemma
18: Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes