1: Dynamic 2D Dictionary Matching in Small Space
2: A Bound on the Throughput of Radio Networks
3: Graph Layouts via Layered Separators
4: Arthur-Merlin Streaming Complexity
5: Probe Scheduling for Efficient Detection of Silent Failures
6: Search using queries on indistinguishable items
7: Lightweight Lempel-Ziv Parsing
8: When are the most informative components for inference also the principal components?
9: A new greedy randomized adaptive search procedure for multiobjective RNA structural alignment
10: A Polynomial Time Algorithm for Lossy Population Recovery
11: Possible and Necessary Winner Problem in Social Polls